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 listMar 10, 2026 19:00Sergey SerebryakovSergey SerebryakovScore: 8,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 19:007,66290,627,30561,575,0002,018,0002,396,160
2Mar 10, 2026 19:007,69486,465,07761,868,0001,995,0002,408,448
3Mar 10, 2026 19:007,93190,508,20564,832,000997,0002,387,968
4Mar 10, 2026 19:008,12394,074,01066,416,0001,006,0002,265,088
5Mar 10, 2026 19:008,19291,676,91065,993,0001,999,0002,392,064
6Mar 10, 2026 19:008,32393,713,51468,077,0001,001,0002,400,256