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 17, 2026 19:27Victor MerckléVictor MerckléScore: 4,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 19:284,50344,795,43736,289,0001,092,0002,113,536
2Jun 17, 2026 19:284,50844,836,85836,343,0001,078,0002,113,536
3Jun 17, 2026 19:284,50945,040,39236,352,0001,076,0002,113,536
4Jun 17, 2026 19:284,51345,068,33436,400,0001,059,0002,113,536
5Jun 17, 2026 19:284,53345,273,49136,620,0001,008,0002,113,536
6Jun 17, 2026 19:284,53746,254,93536,649,0001,009,0002,113,536
7Jun 17, 2026 19:284,71746,781,84938,083,0001,076,0002,113,536
8Jun 17, 2026 19:284,74446,983,80938,347,0001,032,0002,113,536
9Jun 17, 2026 19:284,75347,085,36538,446,0001,004,0002,113,536