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 16, 2026 13:17marko1597marko1597Score: 6,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:416,88567,132,59656,008,0001,143,0002,113,536
2Aug 16, 2026 13:416,88667,169,67956,008,0001,148,0002,113,536
3Aug 16, 2026 13:416,89067,267,58556,050,0001,142,0002,113,536
4Aug 16, 2026 13:416,89468,420,67156,076,0001,145,0002,113,536
5Aug 16, 2026 13:416,89667,163,45856,084,0001,158,0002,113,536
6Aug 16, 2026 13:416,89967,321,79856,114,0001,150,0002,113,536
7Aug 16, 2026 13:416,91267,344,66056,316,0001,058,0002,113,536
8Aug 16, 2026 13:417,05068,436,03557,369,0001,146,0002,113,536
9Aug 16, 2026 13:418,01776,498,47665,405,0001,140,0002,113,536