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 18, 2026 00:44avoidcatenjoyersavoidcatenjoyersScore: 93,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:4593,511786,527,917717,307,00058,835,0002,113,536
2May 18, 2026 00:4593,537785,779,105717,351,00059,013,0002,113,536
3May 18, 2026 00:4593,578788,477,570717,657,00059,047,0002,113,536
4May 18, 2026 00:4593,588788,414,955718,047,00058,740,0002,113,536
5May 18, 2026 00:4593,615788,114,898718,462,00058,545,0002,113,536
6May 18, 2026 00:4593,618788,940,034717,558,00059,477,0002,113,536
7May 18, 2026 00:4593,620788,109,325718,586,00058,463,0002,113,536
8May 18, 2026 00:4593,678789,271,174718,183,00059,349,0002,113,536
9May 18, 2026 00:4593,702787,999,509718,382,00059,350,0002,113,536