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 16, 2026 19:17wnwnScore: 8,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:188,55594,567,15465,010,0006,000,0002,285,568
2Feb 16, 2026 19:188,56997,461,68166,117,0005,008,0002,510,848
3Feb 16, 2026 19:178,633100,813,55867,621,0004,037,0002,506,752
4Feb 16, 2026 19:178,647102,646,55867,786,0003,987,0002,281,472
5Feb 16, 2026 19:188,71495,706,71867,306,0005,022,0002,269,184
6Feb 16, 2026 19:178,78898,248,01966,947,0005,995,0002,285,568