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 09:56Victor MerckléVictor MerckléScore: 3,735Success
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 09:573,72339,321,52529,734,0001,174,0002,113,536
2Aug 27, 2026 09:573,72839,289,78329,818,0001,132,0002,113,536
3Aug 27, 2026 09:573,73039,327,73729,798,0001,164,0002,113,536
4Aug 27, 2026 09:573,73439,309,36229,916,0001,079,0002,113,536
5Aug 27, 2026 09:573,73539,391,36629,846,0001,156,0002,113,536
6Aug 27, 2026 09:573,76339,590,82730,095,0001,145,0002,113,536
7Aug 27, 2026 09:573,77040,415,11330,170,0001,126,0002,113,536
8Aug 27, 2026 09:573,79339,806,03130,324,0001,163,0002,113,536
9Aug 27, 2026 09:573,80139,870,39230,478,0001,072,0002,113,536