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 listAug 27, 2026 10:06Victor MerckléVictor MerckléScore: 3,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 10:063,70239,100,05829,569,0001,165,0002,113,536
2Aug 27, 2026 10:063,73239,579,19929,828,0001,153,0002,113,536
3Aug 27, 2026 10:063,73739,419,14329,888,0001,136,0002,113,536
4Aug 27, 2026 10:063,74639,516,96529,953,0001,142,0002,113,536
5Aug 27, 2026 10:063,75339,518,42230,015,0001,140,0002,113,536
6Aug 27, 2026 10:063,75539,567,99730,089,0001,080,0002,113,536
7Aug 27, 2026 10:063,76539,616,13330,142,0001,108,0002,113,536
8Aug 27, 2026 10:063,76739,603,32830,195,0001,077,0002,113,536
9Aug 27, 2026 10:063,82240,090,95630,585,0001,142,0002,113,536