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 11, 2026 15:54Victor MerckléVictor MerckléScore: 11,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:5511,876106,953,13293,310,0005,269,0002,117,632stderr
2Aug 11, 2026 15:5511,888107,037,72793,414,0005,259,0002,117,632stderr
3Aug 11, 2026 15:5511,891107,061,67193,410,0005,290,0002,117,632stderr
4Aug 11, 2026 15:5511,919107,340,72393,649,0005,279,0002,117,632stderr
5Aug 11, 2026 15:5511,941107,579,11493,762,0005,356,0002,117,632stderr
6Aug 11, 2026 15:5511,948107,613,87193,413,0005,759,0002,117,632stderr
7Aug 11, 2026 15:5511,949107,576,34193,284,0005,893,0002,117,632stderr
8Aug 11, 2026 15:5511,977107,763,65494,111,0005,304,0002,117,632stderr
9Aug 11, 2026 15:5511,981107,895,05094,018,0005,425,0002,117,632stderr