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 25, 2026 06:18wnwnScore: 3,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:193,30734,871,94026,414,0001,036,0002,113,536
2Jun 25, 2026 06:193,30935,102,95826,436,0001,036,0002,113,536
3Jun 25, 2026 06:193,30934,928,90726,463,0001,005,0002,113,536
4Jun 25, 2026 06:193,42337,353,45327,404,0001,014,0002,113,536
5Jun 25, 2026 06:193,45336,396,24527,643,0001,017,0002,113,536
6Jun 25, 2026 06:193,47436,742,97327,830,0001,011,0002,113,536
7Jun 25, 2026 06:193,48536,778,40427,885,0001,042,0002,113,536
8Jun 25, 2026 06:193,49036,616,17527,926,0001,044,0002,113,536
9Jun 25, 2026 06:193,52436,754,72128,247,0001,004,0002,113,536