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 27, 2026 12:57Victor MerckléVictor MerckléScore: 3,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:583,75939,482,92529,990,0001,213,0002,113,536
2Aug 27, 2026 12:583,76039,597,35129,954,0001,262,0002,113,536
3Aug 27, 2026 12:583,76439,565,22129,991,0001,256,0002,113,536
4Aug 27, 2026 12:583,76640,265,70829,993,0001,268,0002,113,536
5Aug 27, 2026 12:583,77140,013,94629,992,0001,310,0002,113,536
6Aug 27, 2026 12:583,77639,690,60930,078,0001,270,0002,113,536
7Aug 27, 2026 12:583,79239,769,36430,239,0001,237,0002,113,536
8Aug 27, 2026 12:583,89241,221,59331,117,0001,188,0002,113,536
9Aug 27, 2026 12:584,23451,520,00233,876,0001,272,0002,113,536