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 listJul 6, 2026 14:22Kevin HeaveyKevin HeaveyScore: 6,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:236,41062,776,28652,075,0001,132,0002,117,632
2Jul 6, 2026 14:236,42062,753,28252,077,0001,216,0002,117,632
3Jul 6, 2026 14:236,43262,933,64152,178,0001,213,0002,117,632
4Jul 6, 2026 14:236,43662,977,79552,174,0001,248,0002,117,632
5Jul 6, 2026 14:236,43862,992,86552,268,0001,173,0002,117,632
6Jul 6, 2026 14:236,47763,313,31852,531,0001,236,0002,117,632
7Jul 6, 2026 14:236,48763,662,96652,584,0001,265,0002,117,632
8Jul 6, 2026 14:236,49363,463,41152,639,0001,259,0002,121,728
9Jul 6, 2026 14:236,49863,970,13152,674,0001,267,0002,117,632