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 6, 2026 15:12merripiummerripiumScore: 71,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:1271,551603,095,868535,159,00058,719,0002,113,536
2Jun 6, 2026 15:1271,579603,361,561535,287,00058,821,0002,113,536
3Jun 6, 2026 15:1271,675604,096,094535,334,00059,569,0002,113,536
4Jun 6, 2026 15:1271,727604,432,369535,179,00060,162,0002,113,536
5Jun 6, 2026 15:1271,741604,555,874535,370,00060,084,0002,113,536
6Jun 6, 2026 15:1271,789604,956,739535,293,00060,562,0002,113,536
7Jun 6, 2026 15:1271,796605,069,319535,231,00060,676,0002,113,536
8Jun 6, 2026 15:1271,807605,066,381535,167,00060,835,0002,113,536
9Jun 6, 2026 15:1271,846605,397,808535,294,00061,033,0002,113,536