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 listJun 15, 2026 08:06Victor MerckléVictor MerckléScore: 4,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 08:074,56145,167,65336,748,0001,112,0002,113,536
2Jun 15, 2026 08:074,56345,306,61636,782,0001,099,0002,113,536
3Jun 15, 2026 08:074,56645,292,78436,904,0001,002,0002,113,536
4Jun 15, 2026 08:074,56845,302,65936,871,0001,044,0002,113,536
5Jun 15, 2026 08:074,57445,377,80936,860,0001,106,0002,113,536
6Jun 15, 2026 08:074,57645,393,82836,981,0001,006,0002,113,536
7Jun 15, 2026 08:074,57645,390,60936,944,0001,045,0002,113,536
8Jun 15, 2026 08:074,57845,393,77836,964,0001,038,0002,113,536
9Jun 15, 2026 08:074,58445,409,21637,029,0001,019,0002,113,536