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:31Josu San MartinJosu San MartinScore: 4,416Success
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:314,39652,227,51235,355,0001,139,0002,551,808
2May 10, 2026 03:314,39751,622,66535,395,0001,107,0002,560,000
3May 10, 2026 03:314,39852,910,14935,393,0001,115,0002,543,616
4May 10, 2026 03:314,40450,643,53935,461,0001,095,0002,539,520
5May 10, 2026 03:314,41652,356,75935,637,0001,019,0002,555,904
6May 10, 2026 03:314,42755,210,45535,724,0001,027,0002,543,616
7May 10, 2026 03:314,44351,687,97535,791,0001,092,0002,547,712
8May 10, 2026 03:314,44954,267,92335,846,0001,082,0002,543,616
9May 10, 2026 03:314,50053,499,50536,319,0001,036,0002,560,000