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 30, 2026 18:08Karthik ReddyKarthik ReddyScore: 3,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:093,47437,807,60127,656,0001,186,0002,113,536
2Sep 30, 2026 18:093,48937,878,65427,775,0001,187,0002,113,536
3Sep 30, 2026 18:093,49037,919,30627,802,0001,173,0002,113,536
4Sep 30, 2026 18:093,50837,912,16827,826,0001,295,0002,113,536
5Sep 30, 2026 18:093,51338,107,11228,141,0001,017,0002,113,536
6Sep 30, 2026 18:093,51337,882,70727,850,0001,313,0002,113,536
7Sep 30, 2026 18:093,51937,945,13027,887,0001,327,0002,113,536
8Sep 30, 2026 18:093,52238,210,61528,015,0001,220,0002,113,536
9Sep 30, 2026 18:093,52638,259,47527,967,0001,301,0002,113,536