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 3, 2026 19:10TudyMTudyMScore: 34,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:1234,515302,628,914285,474,0001,004,0002,379,776
2May 3, 2026 19:1234,521303,295,552285,523,0001,006,0002,387,968
3May 3, 2026 19:1234,521303,262,461285,527,0001,005,0002,371,584
4May 3, 2026 19:1234,528304,711,871285,586,0001,004,0002,375,680
5May 3, 2026 19:1234,534303,965,121285,628,0001,006,0002,392,064
6May 3, 2026 19:1234,534304,533,095285,635,0001,005,0002,375,680
7May 3, 2026 19:1234,535303,093,688285,639,0001,006,0002,383,872
8May 3, 2026 19:1234,544304,181,030285,712,0001,005,0002,375,680
9May 3, 2026 19:1234,548306,230,195285,743,0001,006,0002,371,584