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 30, 2026 08:49Victor MerckléVictor MerckléScore: 11,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:5011,627104,315,87995,380,0001,131,0002,117,632stderr
2Jun 30, 2026 08:5011,636104,457,31195,442,0001,137,0002,117,632stderr
3Jun 30, 2026 08:5011,638104,379,80695,498,0001,104,0002,117,632stderr
4Jun 30, 2026 08:5011,640104,469,81395,515,0001,103,0002,117,632stderr
5Jun 30, 2026 08:5011,663104,700,38995,683,0001,120,0002,117,632stderr
6Jun 30, 2026 08:5011,678104,782,36295,922,0001,012,0002,117,632stderr
7Jun 30, 2026 08:5011,750105,286,69496,492,0001,037,0002,117,632stderr
8Jun 30, 2026 08:5011,831106,045,48397,158,0001,044,0002,117,632stderr
9Jun 30, 2026 08:5011,877106,273,70697,582,0001,003,0002,117,632stderr