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 8, 2026 19:59Victor MerckléVictor MerckléScore: 3,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:023,50238,369,90427,932,0001,141,0002,117,632stderr
2Sep 8, 2026 20:023,56538,324,61128,486,0001,107,0002,117,632stderr
3Sep 8, 2026 20:023,58237,991,03428,633,0001,100,0002,117,632stderr
4Sep 8, 2026 20:023,58738,892,07228,672,0001,103,0002,117,632stderr
5Sep 8, 2026 20:023,59338,985,06728,723,0001,107,0002,117,632stderr
6Sep 8, 2026 20:023,60739,135,06328,847,0001,098,0002,117,632stderr
7Sep 8, 2026 20:023,61238,257,77028,835,0001,148,0002,117,632stderr
8Sep 8, 2026 20:023,63739,411,23829,107,0001,087,0002,117,632stderr
9Sep 8, 2026 20:023,66239,563,91029,259,0001,140,0002,117,632stderr