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 19:04Josu San MartinJosu San MartinScore: 4,953Success
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 19:054,81553,874,22638,666,0001,300,0002,355,200
2May 9, 2026 19:054,86955,485,50939,113,0001,300,0002,355,200
3May 9, 2026 19:054,87657,434,79239,441,0001,032,0002,342,912
4May 9, 2026 19:054,90657,928,47639,692,0001,033,0002,347,008
5May 9, 2026 19:054,95359,033,51740,073,0001,040,0002,347,008
6May 9, 2026 19:055,00856,634,92140,547,0001,026,0002,342,912
7May 9, 2026 19:055,04058,439,28840,794,0001,040,0002,342,912
8May 9, 2026 19:055,07659,176,92041,095,0001,043,0002,342,912
9May 9, 2026 19:055,10461,285,57641,331,0001,033,0002,351,104