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 19, 2026 22:55Mikołaj UzarskiMikołaj UzarskiScore: 5,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:585,76077,164,72441,704,0006,103,0002,289,664
2Feb 19, 2026 22:555,82171,604,37043,285,0005,033,0002,457,600
3Feb 19, 2026 22:555,84677,331,70043,470,0005,054,0002,433,024
4Feb 19, 2026 22:555,89374,971,18940,927,0007,985,0002,523,136
5Feb 19, 2026 22:585,89872,311,84742,958,0005,994,0002,314,240
6Feb 19, 2026 22:585,98079,533,53243,677,0005,956,0002,396,160