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 30, 2026 19:47Josu San MartinJosu San MartinScore: 4,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:484,63546,907,43637,453,0001,022,0002,113,536
2Aug 30, 2026 19:484,64446,930,52737,514,0001,033,0002,113,536
3Aug 30, 2026 19:484,64848,303,23437,494,0001,085,0002,113,536
4Aug 30, 2026 19:484,66447,198,46237,605,0001,111,0002,113,536
5Aug 30, 2026 19:484,66747,218,70537,713,0001,026,0002,113,536
6Aug 30, 2026 19:484,67247,272,50437,696,0001,084,0002,113,536
7Aug 30, 2026 19:484,67847,260,58537,719,0001,116,0002,113,536
8Aug 30, 2026 19:484,76048,009,74138,369,0001,139,0002,113,536
9Aug 30, 2026 19:484,76547,973,45738,472,0001,078,0002,113,536