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 listAug 24, 2026 20:44Victor MerckléVictor MerckléScore: 3,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:453,74439,475,08929,943,0001,137,0002,117,632stderr
2Aug 24, 2026 20:453,75840,293,80130,106,0001,088,0002,117,632stderr
3Aug 24, 2026 20:453,75939,584,57730,123,0001,080,0002,117,632stderr
4Aug 24, 2026 20:453,76239,613,31730,055,0001,175,0002,117,632stderr
5Aug 24, 2026 20:453,79839,894,59030,447,0001,083,0002,117,632stderr
6Aug 24, 2026 20:453,80840,002,63430,566,0001,043,0002,117,632stderr
7Aug 24, 2026 20:453,80940,258,82330,495,0001,122,0002,117,632stderr
8Aug 24, 2026 20:453,81840,114,79130,567,0001,125,0002,117,632stderr
9Aug 24, 2026 20:454,03941,888,67932,312,0001,213,0002,117,632stderr