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 listApr 27, 2026 07:35olliecrowolliecrowScore: 6,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 07:366,20565,396,00349,483,0002,019,0002,469,888
2Apr 27, 2026 07:366,26369,519,38446,992,0004,999,0002,494,464
3Apr 27, 2026 07:366,27167,409,51546,049,0006,006,0002,297,856
4Apr 27, 2026 07:366,28869,622,27148,177,0004,014,0002,289,664
5Apr 27, 2026 07:366,28971,522,83447,184,0005,019,0002,535,424
6Apr 27, 2026 07:366,29066,002,56148,194,0004,016,0002,469,888
7Apr 27, 2026 07:366,30867,586,14150,306,0002,053,0002,424,832
8Apr 27, 2026 07:366,33171,211,10048,509,0004,042,0002,318,336
9Apr 27, 2026 07:366,36067,867,69148,811,0003,984,0002,437,120