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 10, 2026 18:14Josu San MartinJosu San MartinScore: 5,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:145,09153,352,20641,091,0001,168,0002,113,536
2May 10, 2026 18:145,12653,606,41841,391,0001,163,0002,113,536
3May 10, 2026 18:145,18254,484,75541,828,0001,187,0002,113,536
4May 10, 2026 18:145,21355,884,36242,099,0001,169,0002,113,536
5May 10, 2026 18:145,22553,772,08742,201,0001,172,0002,113,536
6May 10, 2026 18:145,24952,825,38842,390,0001,184,0002,113,536
7May 10, 2026 18:145,26652,664,04042,533,0001,181,0002,113,536
8May 10, 2026 18:145,31355,215,16942,942,0001,157,0002,113,536
9May 10, 2026 18:145,33853,042,39143,066,0001,243,0002,113,536