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 02:51Andrew EpsteinAndrew EpsteinScore: 110,147Success
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 02:51109,373918,051,495906,802,0001,001,0002,117,632stderr
2Sep 17, 2026 02:51109,473918,834,606907,623,0001,003,0002,117,632stderr
3Sep 17, 2026 02:51109,836922,038,194910,640,0001,002,0002,117,632stderr
4Sep 17, 2026 02:51110,056923,665,240912,468,0001,003,0002,117,632stderr
5Sep 17, 2026 02:51110,147924,526,615913,211,0001,011,0002,117,632stderr
6Sep 17, 2026 02:51110,168924,729,374913,399,0001,002,0002,117,632stderr
7Sep 17, 2026 02:51110,196924,870,996913,623,0001,007,0002,117,632stderr
8Sep 17, 2026 02:51110,255925,383,927914,119,0001,003,0002,117,632stderr
9Sep 17, 2026 02:51110,766929,622,501917,348,0002,015,0002,117,632stderr