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 29, 2026 09:16Victor MerckléVictor MerckléScore: 4,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 09:184,24743,074,12834,211,0001,040,0002,113,536
2Jun 29, 2026 09:184,25643,162,33934,318,0001,010,0002,113,536
3Jun 29, 2026 09:184,31443,702,34734,719,0001,092,0002,113,536
4Jun 29, 2026 09:184,32843,819,31634,903,0001,020,0002,113,536
5Jun 29, 2026 09:184,65746,560,99537,641,0001,015,0002,113,536
6Jun 29, 2026 09:184,71247,023,84438,083,0001,034,0002,113,536
7Jun 29, 2026 09:184,84748,186,94939,189,0001,047,0002,113,536
8Jun 29, 2026 09:185,00449,421,33940,515,0001,019,0002,113,536
9Jun 29, 2026 09:186,27359,929,18651,062,0001,006,0002,113,536