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 listMar 20, 2026 12:45Dominique GarmierDominique GarmierScore: 7,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:457,50789,569,02460,299,0002,009,0002,289,664
2Mar 20, 2026 12:457,54189,468,04959,609,0002,980,0002,453,504
3Mar 20, 2026 12:457,54692,525,28060,615,0002,020,0002,289,664
4Mar 20, 2026 12:457,57187,420,54060,847,0001,995,0002,289,664
5Mar 20, 2026 12:457,57795,671,23060,892,0001,996,0002,289,664
6Mar 20, 2026 12:457,59089,260,28559,999,0002,999,0002,281,472
7Mar 20, 2026 12:457,60987,467,71361,152,0002,004,0002,289,664
8Mar 20, 2026 12:457,66490,321,49361,590,0002,019,0002,289,664
9Mar 20, 2026 12:457,87793,244,80064,372,0001,005,0002,441,216