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 listFeb 19, 2026 00:44Mikołaj UzarskiMikołaj UzarskiScore: 7,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 00:446,98182,784,70753,945,0003,995,0002,424,832
2Feb 19, 2026 00:447,04990,465,99252,458,0006,052,0002,383,872
3Feb 19, 2026 00:447,20386,255,09952,807,0006,974,0002,441,216