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 17, 2026 20:54wnwnScore: 7,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:546,25673,194,29448,933,0002,995,0002,408,448
2Feb 17, 2026 20:546,31675,149,04049,397,0003,024,0002,461,696
3Feb 17, 2026 20:546,31977,593,03147,407,0005,043,0002,502,656
4Feb 17, 2026 20:547,20885,984,36756,787,0003,042,0002,387,968
5Feb 17, 2026 20:547,21385,631,75456,878,0002,993,0002,449,408
6Feb 17, 2026 20:547,22683,665,46856,978,0002,998,0002,482,176
7Feb 17, 2026 20:547,22887,370,77957,994,0001,999,0002,523,136
8Feb 17, 2026 20:547,27088,734,77557,322,0003,016,0002,322,432
9Feb 17, 2026 20:547,32786,764,81956,825,0003,987,0002,441,216
10Feb 17, 2026 20:547,32786,345,62556,825,0003,987,0002,502,656
11Feb 17, 2026 20:547,34987,024,13057,998,0002,999,0002,453,504
12Feb 17, 2026 20:547,37884,391,02358,224,0003,011,0002,424,832