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 listApr 6, 2026 15:28Danylo MocherniukDanylo MocherniukScore: 6,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:286,74382,027,93953,965,0001,998,0002,428,928
2Apr 6, 2026 15:286,75179,076,39254,033,0002,001,0002,437,120
3Apr 6, 2026 15:286,75280,746,20754,044,0002,001,0002,433,024
4Apr 6, 2026 15:286,76580,370,50453,143,0003,008,0002,424,832
5Apr 6, 2026 15:286,76676,773,55254,151,0002,005,0002,297,856
6Apr 6, 2026 15:286,76877,437,21055,174,0001,003,0002,297,856
7Apr 6, 2026 15:286,79877,141,82255,413,0001,007,0002,297,856
8Apr 6, 2026 15:286,80779,617,63855,490,0001,008,0002,297,856
9Apr 6, 2026 15:286,82584,171,48756,646,00002,297,856
10Apr 6, 2026 15:286,86477,645,03355,969,000999,0002,297,856
11Apr 6, 2026 15:286,88679,861,66756,150,0001,002,0002,424,832
12Apr 6, 2026 15:286,90379,939,95854,283,0003,015,0002,289,664