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:07Josu San MartinJosu San MartinScore: 7,523Success
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:087,45871,277,26252,753,0009,150,0002,113,536
2Jul 4, 2026 00:087,46871,453,33053,268,0008,722,0002,113,536
3Jul 4, 2026 00:087,51171,603,21453,471,0008,871,0002,113,536
4Jul 4, 2026 00:087,51871,662,76153,769,0008,634,0002,113,536
5Jul 4, 2026 00:087,52371,878,44953,693,0008,753,0002,113,536
6Jul 4, 2026 00:087,53371,920,82553,760,0008,770,0002,113,536
7Jul 4, 2026 00:087,63872,710,83754,754,0008,642,0002,113,536
8Jul 4, 2026 00:087,65072,914,58854,942,0008,554,0002,113,536
9Jul 4, 2026 00:087,72073,463,26055,502,0008,575,0002,113,536