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 11:50Adam FolwarcznyAdam FolwarcznyScore: 13,349Success
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 11:5113,192119,035,198105,466,0004,028,0002,117,632stderr
2Jun 29, 2026 11:5113,254119,521,692106,758,0003,254,0002,117,632stderr
3Jun 29, 2026 11:5113,326120,185,957107,379,0003,231,0002,117,632stderr
4Jun 29, 2026 11:5113,346120,697,780107,477,0003,299,0002,117,632stderr
5Jun 29, 2026 11:5113,349120,317,931107,503,0003,294,0002,117,632stderr
6Jun 29, 2026 11:5113,351120,349,829106,725,0004,094,0002,117,632stderr
7Jun 29, 2026 11:5113,389120,990,354107,038,0004,093,0002,117,632stderr
8Jun 29, 2026 11:5113,888124,871,693111,015,0004,263,0002,117,632stderr
9Jun 29, 2026 11:5114,314128,350,017114,528,0004,284,0002,117,632stderr