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 29, 2026 01:03Victor MerckléVictor MerckléScore: 4,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:054,48244,888,20336,144,0001,063,0002,113,536
2Jun 29, 2026 01:054,49145,067,12136,273,0001,009,0002,113,536
3Jun 29, 2026 01:054,49246,795,20236,252,0001,035,0002,113,536
4Jun 29, 2026 01:054,49445,179,77636,275,0001,032,0002,113,536
5Jun 29, 2026 01:054,49545,123,58736,276,0001,037,0002,113,536
6Jun 29, 2026 01:054,49845,012,14736,254,0001,085,0002,113,536
7Jun 29, 2026 01:054,49945,028,35536,262,0001,080,0002,113,536
8Jun 29, 2026 01:054,50245,118,68736,365,0001,008,0002,113,536
9Jun 29, 2026 01:054,52045,265,42436,479,0001,039,0002,113,536