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 16, 2026 23:58Andrew EpsteinAndrew EpsteinScore: 220,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:58220,4621,840,031,0691,828,841,0001,001,0002,117,632stderr
2Sep 16, 2026 23:58220,6481,841,580,4751,830,383,0001,000,0002,117,632stderr
3Sep 16, 2026 23:58220,6901,842,055,5801,830,735,0001,000,0002,117,632stderr
4Sep 16, 2026 23:58220,7101,842,362,1531,829,866,0002,033,0002,117,632stderr
5Sep 16, 2026 23:58220,7291,842,370,6391,831,052,0001,002,0002,117,632stderr
6Sep 16, 2026 23:58220,7631,842,639,2821,831,337,0001,003,0002,117,632stderr
7Sep 16, 2026 23:58222,9071,860,425,0241,849,132,0001,000,0002,117,632stderr
8Sep 16, 2026 23:58223,2801,863,599,6871,852,229,0001,000,0002,117,632stderr
9Sep 16, 2026 23:58223,4301,864,758,7031,852,430,0002,043,0002,117,632stderr