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 03:30Josu San MartinJosu San MartinScore: 4,468Success
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 03:304,44652,543,65735,796,0001,111,0002,555,904
2May 10, 2026 03:304,45355,307,97535,949,0001,018,0002,560,000
3May 10, 2026 03:304,45455,094,61635,947,0001,025,0002,543,616
4May 10, 2026 03:304,46352,605,34135,893,0001,154,0002,551,808
5May 10, 2026 03:304,46850,998,03635,905,0001,187,0002,555,904
6May 10, 2026 03:304,47053,658,55835,983,0001,121,0002,560,000
7May 10, 2026 03:304,47650,376,35236,082,0001,077,0002,551,808
8May 10, 2026 03:304,51354,319,79236,433,0001,030,0002,551,808
9May 10, 2026 03:304,63054,939,24737,401,0001,035,0002,547,712