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 2, 2025 20:40Jack FrigaardJack FrigaardScore: 4,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:404,85066,441,98537,238,0003,019,0002,465,792
2Aug 2, 2025 20:404,85270,020,63737,249,0003,020,0002,469,888
3Aug 2, 2025 20:404,90566,879,98538,678,0002,035,0002,281,472
4Aug 2, 2025 20:404,99065,012,24240,411,0001,010,0002,281,472
5Aug 2, 2025 20:405,00069,276,33640,486,0001,012,0002,281,472
6Aug 2, 2025 20:405,00064,355,66340,490,0001,012,0002,473,984