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 listJul 14, 2026 01:32Jarry XiaoJarry XiaoScore: 11,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 01:3411,159102,246,94291,608,0001,013,0002,121,728stderr
2Jul 14, 2026 01:3411,172102,258,00491,719,0001,015,0002,121,728stderr
3Jul 14, 2026 01:3411,178102,442,89291,766,0001,015,0002,121,728stderr
4Jul 14, 2026 01:3411,192104,095,64591,889,0001,012,0002,121,728stderr
5Jul 14, 2026 01:3411,246102,905,58892,330,0001,014,0002,121,728stderr
6Jul 14, 2026 01:3411,339103,716,42093,108,0001,012,0002,121,728stderr
7Jul 14, 2026 01:3412,688114,897,814104,299,0001,015,0002,121,728stderr
8Jul 14, 2026 01:3412,790115,738,018105,149,0001,015,0002,121,728stderr
9Jul 14, 2026 01:3413,017117,694,523107,034,0001,014,0002,121,728stderr