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 26, 2026 20:21Mikołaj UzarskiMikołaj UzarskiScore: 5,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 20:215,15871,510,53439,824,0002,986,0002,289,664
2Feb 26, 2026 20:215,16268,037,00839,854,0002,989,0002,400,256
3Feb 26, 2026 20:215,17467,391,06639,949,0002,996,0002,281,472