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 listOct 11, 2026 19:38boop34boop34Score: 9,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 19:399,01083,720,87573,658,0001,127,0002,117,632
2Oct 11, 2026 19:399,03483,966,99273,929,0001,057,0002,117,632
3Oct 11, 2026 19:399,04784,123,59274,070,0001,024,0002,117,632
4Oct 11, 2026 19:399,07584,403,63374,301,0001,028,0002,117,632
5Oct 11, 2026 19:399,09184,485,10174,427,0001,035,0002,117,632
6Oct 11, 2026 19:399,09484,382,44674,454,0001,027,0002,117,632
7Oct 11, 2026 19:399,10384,492,78874,536,0001,025,0002,117,632
8Oct 11, 2026 19:399,20485,461,20075,326,0001,071,0002,117,632
9Oct 11, 2026 19:399,43887,316,56277,213,0001,128,0002,117,632