Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 1, 2026 06:10Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 12,591Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 06:1012,440113,926,59641,592,00061,661,00020,480
2Nov 1, 2026 06:1012,508114,498,80141,860,00061,960,00020,480
3Nov 1, 2026 06:1012,572114,981,81442,068,00062,285,00020,480
4Nov 1, 2026 06:1012,585115,179,44141,919,00062,541,00020,480
5Nov 1, 2026 06:1012,591115,285,37341,336,00063,172,00020,480
6Nov 1, 2026 06:1012,594115,228,14042,688,00061,849,00020,480
7Nov 1, 2026 06:1012,635115,553,70442,146,00062,732,00020,480
8Nov 1, 2026 06:1012,650116,932,95242,500,00062,495,0002,113,536
9Nov 1, 2026 06:1012,658115,766,00242,321,00062,741,00020,480