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 23:25Victor MerckléVictor MerckléScore: 4,157Success
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 23:264,12042,135,17633,100,0001,100,0002,117,632stderr
2Jun 30, 2026 23:264,12942,062,79233,156,0001,116,0002,117,632stderr
3Jun 30, 2026 23:264,15342,216,42333,434,0001,038,0002,117,632stderr
4Jun 30, 2026 23:264,15442,299,53733,459,0001,020,0002,117,632stderr
5Jun 30, 2026 23:264,15742,271,18833,457,0001,050,0002,117,632stderr
6Jun 30, 2026 23:264,16042,339,66333,438,0001,097,0002,117,632stderr
7Jun 30, 2026 23:264,17442,446,01933,626,0001,021,0002,117,632stderr
8Jun 30, 2026 23:264,25643,176,10534,194,0001,132,0002,117,632stderr
9Jun 30, 2026 23:264,27843,230,45534,428,0001,087,0002,117,632stderr