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 13:33Andrew EpsteinAndrew EpsteinScore: 124,050Success
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 13:47123,7841,037,672,7801,026,403,0001,010,0002,117,632stderr
2Sep 17, 2026 13:47123,9091,039,367,6441,027,438,0001,008,0002,117,632stderr
3Sep 17, 2026 13:47123,9111,038,816,5971,027,459,0001,003,0002,117,632stderr
4Sep 17, 2026 13:47124,0381,039,777,8331,028,516,0001,006,0002,117,632stderr
5Sep 17, 2026 13:47124,0501,039,872,6541,028,618,0001,003,0002,117,632stderr
6Sep 17, 2026 13:47124,1591,040,774,2981,029,518,0001,002,0002,117,632stderr
7Sep 17, 2026 13:47124,2511,041,477,7571,030,283,0001,002,0002,117,632stderr
8Sep 17, 2026 13:47124,3411,042,270,0391,031,013,0001,018,0002,117,632stderr
9Sep 17, 2026 13:47124,3591,043,405,6891,031,184,0001,003,0002,117,632stderr