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:33Andrew EpsteinAndrew EpsteinScore: 225,589Success
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:33224,8961,876,858,1381,865,627,0001,010,0002,117,632stderr
2Sep 16, 2026 23:33224,9651,877,489,2691,866,213,0001,003,0002,117,632stderr
3Sep 16, 2026 23:33225,1041,878,603,5631,867,364,0001,005,0002,117,632stderr
4Sep 16, 2026 23:33225,2971,880,285,3061,868,965,0001,001,0002,117,632stderr
5Sep 16, 2026 23:33225,5891,882,701,3511,871,383,0001,006,0002,117,632stderr
6Sep 16, 2026 23:33225,7421,883,894,5971,872,657,0001,005,0002,117,632stderr
7Sep 16, 2026 23:33225,7921,884,370,3251,873,072,0001,009,0002,117,632stderr
8Sep 16, 2026 23:33225,8051,885,050,6041,873,185,0001,004,0002,117,632stderr
9Sep 16, 2026 23:33225,9841,885,978,4101,874,662,0001,007,0002,117,632stderr