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 1, 2026 00:53zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 15:04M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:3109,164,56601,712,00016,384No answer to stdout. Died or killed?
2Apr 1, 2026 00:533,40055,409,43926,205,0002,015,0002,519,040
3Apr 1, 2026 00:533,40249,651,88926,222,0002,017,0002,510,848
4Apr 1, 2026 00:533,40551,088,66127,255,0001,009,0002,437,120
5Apr 1, 2026 00:533,40753,361,45027,266,0001,009,0002,433,024
6Apr 1, 2026 00:533,41559,434,62627,330,0001,012,0002,437,120
7Apr 1, 2026 00:533,41748,318,58427,352,0001,013,0002,437,120