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 listAug 26, 2026 04:07Victor MerckléVictor MerckléScore: 3,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:073,89040,695,25731,171,0001,124,0002,117,632stderr
2Aug 26, 2026 04:073,90240,773,98231,239,0001,149,0002,117,632stderr
3Aug 26, 2026 04:073,91440,905,37831,330,0001,163,0002,117,632stderr
4Aug 26, 2026 04:073,91940,890,24631,467,0001,062,0002,117,632stderr
5Aug 26, 2026 04:073,92940,993,29831,602,0001,015,0002,117,632stderr
6Aug 26, 2026 04:073,94041,051,23131,623,0001,082,0002,117,632stderr
7Aug 26, 2026 04:074,00641,647,25632,116,0001,138,0002,117,632stderr
8Aug 26, 2026 04:074,06242,115,76332,586,0001,133,0002,117,632stderr
9Aug 26, 2026 04:074,06542,763,09332,623,0001,119,0002,117,632stderr