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 03:20Andrew EpsteinAndrew EpsteinScore: 104,279Success
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 03:21103,818872,143,173858,606,0003,086,0002,121,728stderr
2Sep 17, 2026 03:21104,066874,246,120860,637,0003,113,0002,121,728stderr
3Sep 17, 2026 03:21104,256876,998,290863,253,0002,077,0002,121,728stderr
4Sep 17, 2026 03:21104,276875,917,447863,423,0002,068,0002,121,728stderr
5Sep 17, 2026 03:21104,279876,383,277863,464,0002,058,0002,121,728stderr
6Sep 17, 2026 03:21104,331876,533,423862,711,0003,237,0002,117,632stderr
7Sep 17, 2026 03:21104,365877,400,397863,141,0003,092,0002,121,728stderr
8Sep 17, 2026 03:21104,380876,725,846864,267,0002,093,0002,121,728stderr
9Sep 17, 2026 03:21104,608878,569,161866,174,0002,079,0002,117,632stderr