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 15, 2026 23:47Victor MerckléVictor MerckléScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:476,94766,945,77456,656,0001,008,0002,113,536
2May 15, 2026 23:476,94865,076,41956,668,0001,005,0002,113,536
3May 15, 2026 23:476,94965,747,12757,680,00002,113,536
4May 15, 2026 23:476,94964,910,78156,632,0001,045,0002,113,536
5May 15, 2026 23:476,95165,894,97157,699,00002,113,536
6May 15, 2026 23:476,95269,205,19056,691,0001,016,0002,113,536
7May 15, 2026 23:476,96367,967,19356,793,0001,002,0002,113,536
8May 15, 2026 23:476,97766,934,11156,915,0001,002,0002,113,536
9May 15, 2026 23:477,00265,602,98057,071,0001,048,0002,113,536