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 10, 2026 11:14Victor MerckléVictor MerckléScore: 4,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:154,51845,129,43436,426,0001,075,0002,113,536
2Jun 10, 2026 11:154,52345,020,22736,481,0001,062,0002,113,536
3Jun 10, 2026 11:154,52345,135,02836,542,0001,002,0002,113,536
4Jun 10, 2026 11:154,52844,970,51736,478,0001,105,0002,113,536
5Jun 10, 2026 11:154,53245,311,94336,491,0001,128,0002,113,536
6Jun 10, 2026 11:154,54345,076,31836,666,0001,044,0002,113,536
7Jun 10, 2026 11:154,54345,655,02336,610,0001,101,0002,113,536
8Jun 10, 2026 11:154,73846,908,15938,295,0001,033,0002,113,536
9Jun 10, 2026 11:154,74146,788,70838,341,0001,016,0002,113,536