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 25, 2026 18:51Victor MerckléVictor MerckléScore: 4,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:524,31543,873,47734,736,0001,086,0002,113,536
2Jun 25, 2026 18:524,33343,543,87734,875,0001,092,0002,113,536
3Jun 25, 2026 18:524,33843,720,56534,918,0001,089,0002,113,536
4Jun 25, 2026 18:524,33943,590,18434,907,0001,110,0002,113,536
5Jun 25, 2026 18:524,34744,938,34234,975,0001,109,0002,113,536
6Jun 25, 2026 18:524,36343,775,99035,124,0001,089,0002,113,536
7Jun 25, 2026 18:524,41444,240,15635,566,0001,078,0002,113,536
8Jun 25, 2026 18:524,46144,594,38435,924,0001,106,0002,113,536
9Jun 25, 2026 18:524,67746,837,75437,817,0001,003,0002,113,536