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 listMay 15, 2026 10:32Victor MerckléVictor MerckléScore: 6,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 10:326,96667,180,95656,815,0001,004,0002,113,536
2May 15, 2026 10:326,96666,927,60557,824,00002,113,536
3May 15, 2026 10:326,96866,837,13157,842,00002,113,536
4May 15, 2026 10:326,96967,985,03957,849,00002,113,536
5May 15, 2026 10:326,96965,418,39656,845,0001,002,0002,113,536
6May 15, 2026 10:326,97065,102,18857,852,00002,113,536
7May 15, 2026 10:326,97167,774,37456,821,0001,040,0002,113,536
8May 15, 2026 10:326,97266,940,10856,869,0001,005,0002,113,536
9May 15, 2026 10:326,97366,861,10556,875,0001,007,0002,113,536