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 listSep 14, 2026 00:23drewbumpasdrewbumpasScore: 55,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:2355,796473,262,095462,108,0001,004,0002,113,536
2Sep 14, 2026 00:2355,802473,317,908462,156,0001,005,0002,113,536
3Sep 14, 2026 00:2355,804473,411,697462,174,0001,003,0002,113,536
4Sep 14, 2026 00:2355,806473,381,390462,193,0001,003,0002,113,536
5Sep 14, 2026 00:2355,820473,509,664462,304,0001,003,0002,113,536
6Sep 14, 2026 00:2355,824473,578,016462,342,0001,004,0002,113,536
7Sep 14, 2026 00:2355,828473,641,073462,370,0001,004,0002,113,536
8Sep 14, 2026 00:2355,853473,775,586462,578,0001,005,0002,113,536
9Sep 14, 2026 00:2355,871474,001,073462,728,0001,008,0002,113,536