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 11, 2026 00:35Josu 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 11, 2026 00:36045,693,13936,948,0001,084,0002,113,536expected "53690711166297466 ", got "53690711084416386 "
2May 11, 2026 00:364,45045,754,49735,832,0001,110,0002,113,536
3May 11, 2026 00:364,45444,963,48035,900,0001,072,0002,113,536
4May 11, 2026 00:364,47746,596,28936,087,0001,078,0002,113,536
5May 11, 2026 00:364,48845,463,17536,189,0001,069,0002,113,536
6May 11, 2026 00:364,49345,422,96436,201,0001,095,0002,113,536
7May 11, 2026 00:364,58047,564,34436,933,0001,085,0002,113,536
8May 11, 2026 00:364,59248,434,70237,032,0001,087,0002,113,536
9May 11, 2026 00:364,70648,631,31337,964,0001,097,0002,113,536