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 10, 2026 14:07wnwnScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:073,26334,390,76427,089,00002,113,536
2May 10, 2026 14:073,27336,616,64927,174,00002,113,536
3May 10, 2026 14:073,27434,466,16127,179,00002,113,536
4May 10, 2026 14:073,27736,560,12727,206,00002,113,536
5May 10, 2026 14:073,41135,665,50128,319,00002,113,536
6May 10, 2026 14:073,41437,427,46828,340,00002,113,536
7May 10, 2026 14:073,42037,803,36128,390,00002,113,536
8May 10, 2026 14:073,42136,473,19427,396,0001,006,0002,113,536
9May 10, 2026 14:073,42638,349,44628,444,00002,113,536