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 9, 2026 22:43Josu San MartinJosu San MartinScore: 4,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:444,76256,889,91338,336,0001,196,0002,371,584
2May 9, 2026 22:444,77457,987,28238,443,0001,183,0002,383,872
3May 9, 2026 22:444,79656,669,03138,612,0001,202,0002,375,680
4May 9, 2026 22:444,82554,769,87638,834,0001,218,0002,375,680
5May 9, 2026 22:444,84255,977,75739,005,0001,188,0002,363,392
6May 9, 2026 22:444,93555,745,82939,749,0001,219,0002,375,680
7May 9, 2026 22:444,93759,315,10139,812,0001,171,0002,375,680
8May 9, 2026 22:444,94457,662,93039,824,0001,214,0002,371,584
9May 9, 2026 22:444,96560,029,48040,159,0001,051,0002,383,872