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 11, 2026 01:15Josu San MartinJosu San MartinScore: 4,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:154,13745,102,71633,246,0001,092,0002,113,536
2May 11, 2026 01:154,13844,293,24333,257,0001,096,0002,113,536
3May 11, 2026 01:154,14043,999,86733,229,0001,134,0002,113,536
4May 11, 2026 01:154,14143,335,73733,278,0001,099,0002,113,536
5May 11, 2026 01:154,14844,173,83533,340,0001,092,0002,113,536
6May 11, 2026 01:154,20144,386,68933,779,0001,093,0002,113,536
7May 11, 2026 01:154,20442,556,44533,814,0001,086,0002,113,536
8May 11, 2026 01:154,21344,761,07733,874,0001,094,0002,113,536
9May 11, 2026 01:154,24043,924,30934,120,0001,075,0002,113,536