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 listSep 17, 2026 00:17Andrew EpsteinAndrew EpsteinScore: 6,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:186,86667,147,47255,949,0001,047,0002,113,536
2Sep 17, 2026 00:186,91267,492,52256,342,0001,035,0002,113,536
3Sep 17, 2026 00:186,94767,833,35556,623,0001,043,0002,113,536
4Sep 17, 2026 00:186,95667,915,18056,556,0001,181,0002,113,536
5Sep 17, 2026 00:186,97268,098,78056,826,0001,048,0002,113,536
6Sep 17, 2026 00:186,97668,077,02956,843,0001,059,0002,113,536
7Sep 17, 2026 00:186,97968,087,67656,919,0001,009,0002,113,536
8Sep 17, 2026 00:187,00868,346,83457,113,0001,059,0002,113,536
9Sep 17, 2026 00:187,03068,560,49757,294,0001,060,0002,113,536