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 28, 2026 03:40Victor MerckléVictor MerckléScore: 4,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 03:414,16842,410,19133,552,0001,043,0002,113,536
2Jun 28, 2026 03:414,16842,334,36333,479,0001,116,0002,113,536
3Jun 28, 2026 03:414,17042,468,88533,530,0001,084,0002,113,536
4Jun 28, 2026 03:414,17342,444,66633,612,0001,032,0002,113,536
5Jun 28, 2026 03:414,17942,431,69133,647,0001,043,0002,113,536
6Jun 28, 2026 03:414,18943,122,74133,729,0001,045,0002,113,536
7Jun 28, 2026 03:414,24843,089,16434,184,0001,075,0002,113,536
8Jun 28, 2026 03:414,29343,443,58034,554,0001,081,0002,113,536
9Jun 28, 2026 03:414,32243,601,34634,811,0001,065,0002,113,536