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 12, 2026 10:37Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 10:38044,135,96433,730,0001,037,0002,113,536expected "53689330190770473 ", got "53689329934770473 "
2May 12, 2026 10:38043,949,56333,898,0001,028,0002,113,536expected "53684969094879453 ", got "53684968838879453 "
3May 12, 2026 10:384,18442,150,14133,728,0001,004,0002,113,536
4May 12, 2026 10:384,18744,086,62733,731,0001,022,0002,113,536
5May 12, 2026 10:384,20044,190,44933,842,0001,024,0002,113,536
6May 12, 2026 10:384,21744,380,62134,005,0001,002,0002,113,536
7May 12, 2026 10:384,22043,276,76234,020,0001,012,0002,113,536
8May 12, 2026 10:384,25244,610,92934,220,0001,075,0002,113,536
9May 12, 2026 10:384,29944,440,65034,609,0001,080,0002,113,536