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 listSep 23, 2026 08:14Kevin HeaveyKevin HeaveyScore: 3,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:193,31036,335,87026,355,0001,126,0002,113,536
2Sep 23, 2026 08:193,33636,329,07126,525,0001,169,0002,113,536
3Sep 23, 2026 08:193,33937,265,55026,700,0001,020,0002,113,536
4Sep 23, 2026 08:193,34336,881,59426,604,0001,148,0002,113,536
5Sep 23, 2026 08:193,35236,656,62726,690,0001,133,0002,113,536
6Sep 23, 2026 08:193,35436,486,58326,813,0001,030,0002,113,536
7Sep 23, 2026 08:193,35637,491,22026,834,0001,027,0002,113,536
8Sep 23, 2026 08:193,37436,786,91026,950,0001,058,0002,113,536
9Sep 23, 2026 08:193,37537,464,15126,852,0001,168,0002,113,536