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 20, 2026 00:32Maya RebholzMaya RebholzScore: 14,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 00:3314,542130,274,110114,105,0006,596,0002,113,536
2May 20, 2026 00:3314,546130,164,573114,081,0006,652,0002,113,536
3May 20, 2026 00:3314,547132,012,082114,100,0006,641,0002,113,536
4May 20, 2026 00:3314,555130,817,408114,162,0006,648,0002,113,536
5May 20, 2026 00:3314,557132,454,272114,156,0006,670,0002,113,536
6May 20, 2026 00:3314,566132,504,124114,142,0006,762,0002,113,536
7May 20, 2026 00:3314,573132,645,069114,303,0006,656,0002,113,536
8May 20, 2026 00:3314,575131,981,621114,091,0006,886,0002,113,536
9May 20, 2026 00:3314,641134,525,136114,099,0007,429,0002,113,536