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 listApr 19, 2026 03:49wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:09041,485,92332,455,0001,009,0002,113,536expected "74600294196621100 ", got "74534440028168820 "
2Jul 6, 2026 21:09043,571,18934,692,0001,023,0002,113,536expected "74600294196621100 ", got "74535241511762970 "
3Jul 6, 2026 21:09043,652,27134,617,0001,018,0002,113,536expected "74600294196621100 ", got "74535239648888970 "
4Apr 19, 2026 03:494,09063,761,88431,949,0001,996,0002,498,560
5Apr 19, 2026 03:494,09162,285,63531,960,0001,997,0002,531,328
6Apr 19, 2026 03:494,12656,469,19633,242,0001,007,0002,531,328
7Apr 19, 2026 03:494,19957,709,42232,862,0001,991,0002,531,328
8Apr 19, 2026 03:494,22059,668,42433,027,0002,001,0002,531,328
9Apr 19, 2026 03:494,29562,185,82734,631,0001,018,0002,531,328