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 01:07Andrew EpsteinAndrew EpsteinScore: 123,717Success
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 01:08122,5751,027,897,1221,013,662,0003,711,0002,117,632stderr
2Sep 17, 2026 01:08122,7731,029,473,1711,015,474,0003,548,0002,117,632stderr
3Sep 17, 2026 01:08122,7851,029,504,2641,015,640,0003,483,0002,117,632stderr
4Sep 17, 2026 01:08123,5121,035,441,2381,021,760,0003,396,0002,117,632stderr
5Sep 17, 2026 01:08123,7171,037,210,9231,023,331,0003,527,0002,117,632stderr
6Sep 17, 2026 01:08123,9041,038,601,3871,025,083,0003,327,0002,117,632stderr
7Sep 17, 2026 01:08124,1511,041,973,1041,027,064,0003,394,0002,117,632stderr
8Sep 17, 2026 01:08124,3471,042,942,2331,028,731,0003,355,0002,117,632stderr
9Sep 17, 2026 01:08124,8781,046,782,0641,033,083,0003,406,0002,117,632stderr