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 listJul 4, 2026 00:59Josu San MartinJosu San MartinScore: 5,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:595,12251,920,96140,424,0002,090,0002,113,536
2Jul 4, 2026 00:595,14252,097,32340,623,0002,060,0002,117,632
3Jul 4, 2026 00:595,14552,081,44840,630,0002,077,0002,117,632
4Jul 4, 2026 00:595,18652,329,89540,968,0002,079,0002,113,536
5Jul 4, 2026 00:595,20352,563,74541,146,0002,047,0002,113,536
6Jul 4, 2026 00:595,27353,244,15241,725,0002,042,0002,113,536
7Jul 4, 2026 00:595,29753,385,45941,894,0002,072,0002,113,536
8Jul 4, 2026 00:595,36653,791,45742,501,0002,042,0002,113,536
9Jul 4, 2026 00:596,07659,868,56448,402,0002,033,0002,113,536