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 17, 2026 21:48Victor MerckléVictor MerckléScore: 8,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 21:498,59379,018,00070,257,0001,070,0002,113,536
2Jun 17, 2026 21:498,59778,748,41670,288,0001,068,0002,113,536
3Jun 17, 2026 21:498,60479,016,96670,346,0001,072,0002,113,536
4Jun 17, 2026 21:498,61179,095,64470,397,0001,075,0002,113,536
5Jun 17, 2026 21:498,61479,105,43370,427,0001,071,0002,113,536
6Jun 17, 2026 21:498,62679,233,89570,557,0001,042,0002,113,536
7Jun 17, 2026 21:498,63279,290,21070,621,0001,026,0002,113,536
8Jun 17, 2026 21:498,63479,249,62270,636,0001,028,0002,113,536
9Jun 17, 2026 21:498,66679,564,81370,807,0001,129,0002,113,536