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 listMay 17, 2026 14:16Victor MerckléVictor MerckléScore: 8,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:308,22376,258,20268,253,00002,113,536
2May 17, 2026 14:308,22977,299,53567,272,0001,035,0002,113,536
3May 17, 2026 14:308,23375,696,42767,317,0001,023,0002,113,536
4May 17, 2026 14:308,23778,762,76767,368,0001,004,0002,113,536
5May 17, 2026 14:308,23876,493,01067,376,0001,006,0002,113,536
6May 17, 2026 14:308,25476,856,18467,511,0001,005,0002,113,536
7May 17, 2026 14:308,27777,830,28667,672,0001,034,0002,113,536
8May 17, 2026 14:308,27977,837,78167,720,0001,003,0002,113,536
9May 17, 2026 14:308,32978,142,20068,087,0001,046,0002,113,536