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 15, 2026 19:45Mikołaj UzarskiMikołaj UzarskiScore: 6,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 19:456,03072,898,21146,045,0004,003,0002,510,848
2Feb 15, 2026 19:456,04073,283,21643,115,0007,018,0002,404,352
3Feb 15, 2026 19:456,19178,468,21845,343,0006,045,0002,363,392