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 04:14Josu San MartinJosu San MartinScore: 4,368Success
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 04:144,33052,309,09234,854,0001,092,0002,547,712
2May 10, 2026 04:144,33751,756,94934,877,0001,122,0002,547,712
3May 10, 2026 04:144,33951,869,24934,867,0001,147,0002,560,000
4May 10, 2026 04:144,36152,077,44835,164,0001,035,0002,551,808
5May 10, 2026 04:144,36854,436,06835,206,0001,053,0002,551,808
6May 10, 2026 04:144,36951,738,49235,224,0001,045,0002,555,904
7May 10, 2026 04:144,38354,763,86335,273,0001,107,0002,555,904
8May 10, 2026 04:144,41555,312,51435,591,0001,056,0002,547,712
9May 10, 2026 04:144,69654,694,92937,945,0001,033,0002,543,616