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 listMay 18, 2026 11:26Victor MerckléVictor MerckléScore: 10,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 11:2810,653100,439,77887,270,0001,153,0002,113,536
2May 18, 2026 11:2810,65899,634,32487,324,0001,141,0002,113,536
3May 18, 2026 11:2810,659100,109,75787,326,0001,148,0002,113,536
4May 18, 2026 11:2810,65997,764,37487,334,0001,142,0002,113,536
5May 18, 2026 11:2810,66499,748,73987,372,0001,144,0002,113,536
6May 18, 2026 11:2810,67398,592,91187,566,0001,021,0002,113,536
7May 18, 2026 11:2810,67699,476,49687,473,0001,141,0002,113,536
8May 18, 2026 11:2810,67697,822,42087,466,0001,151,0002,113,536
9May 18, 2026 11:2810,68799,727,68687,678,0001,032,0002,113,536