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 28, 2026 16:43Daniel MastalerzDaniel MastalerzScore: 6,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 16:436,03159,572,12949,032,0001,031,0002,113,536
2Jun 28, 2026 16:436,03359,536,22349,046,0001,029,0002,113,536
3Jun 28, 2026 16:436,03659,611,37049,067,0001,038,0002,113,536
4Jun 28, 2026 16:436,04459,791,18349,119,0001,048,0002,113,536
5Jun 28, 2026 16:436,04959,760,30349,169,0001,040,0002,113,536
6Jun 28, 2026 16:436,07959,998,06349,409,0001,049,0002,113,536
7Jun 28, 2026 16:436,09260,079,74349,526,0001,038,0002,113,536
8Jun 28, 2026 16:436,12960,435,64149,829,0001,045,0002,113,536
9Jun 28, 2026 16:436,14960,515,06649,991,0001,052,0002,113,536