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 27, 2026 16:07Victor MerckléVictor MerckléScore: 4,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 16:084,16842,277,78233,541,0001,058,0002,113,536
2Jun 27, 2026 16:084,17142,288,35933,597,0001,029,0002,113,536
3Jun 27, 2026 16:084,17942,337,96233,656,0001,037,0002,113,536
4Jun 27, 2026 16:084,18942,499,76133,718,0001,054,0002,113,536
5Jun 27, 2026 16:084,19642,560,45133,798,0001,036,0002,113,536
6Jun 27, 2026 16:084,31343,480,00934,763,0001,037,0002,113,536
7Jun 27, 2026 16:084,32443,558,30734,857,0001,038,0002,113,536
8Jun 27, 2026 16:084,34843,938,40035,036,0001,060,0002,113,536
9Jun 27, 2026 16:084,41344,360,69435,534,0001,099,0002,113,536