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 listJan 7, 2026 08:34Petsku01Petsku01Score: 63,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 08:3463,642550,759,005527,228,0001,000,0002,265,088
2Jan 7, 2026 08:3463,655553,305,154527,338,0001,000,0002,277,376
3Jan 7, 2026 08:3463,670557,885,133525,466,0002,996,0002,277,376
4Jan 7, 2026 08:3463,670552,579,928528,462,00002,277,376
5Jan 7, 2026 08:3463,682554,285,986525,567,0002,997,0002,277,376
6Jan 7, 2026 08:3463,697558,268,868527,683,000999,0002,277,376
7Jan 7, 2026 08:3463,705556,945,015526,752,0001,999,0002,277,376
8Jan 7, 2026 08:3463,719558,122,042526,871,0001,999,0002,277,376
9Jan 7, 2026 08:3463,736555,798,447527,006,0002,000,0002,527,232