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 10, 2026 14:22Josu San MartinJosu San MartinScore: 4,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:224,14642,004,06233,379,0001,041,0002,113,536
2May 10, 2026 14:224,16343,252,97633,526,0001,031,0002,113,536
3May 10, 2026 14:224,16744,805,80133,549,0001,042,0002,113,536
4May 10, 2026 14:224,16742,027,59333,547,0001,040,0002,113,536
5May 10, 2026 14:224,17141,939,15433,577,0001,047,0002,113,536
6May 10, 2026 14:224,17342,012,54133,568,0001,071,0002,113,536
7May 10, 2026 14:224,18843,885,33733,703,0001,058,0002,113,536
8May 10, 2026 14:224,21842,795,29733,956,0001,055,0002,113,536
9May 10, 2026 14:224,24143,118,91434,154,0001,049,0002,113,536