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 24, 2026 00:08olliecrowolliecrowScore: 6,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 00:086,36070,701,85349,803,0002,988,0002,437,120
2Apr 24, 2026 00:086,39269,983,30551,055,0002,002,0002,453,504
3Apr 24, 2026 00:086,42772,887,93049,323,0004,026,0002,510,848
4Apr 24, 2026 00:086,42874,528,42351,344,0002,013,0002,347,008
5Apr 24, 2026 00:086,43169,801,26348,348,0005,036,0002,441,216
6Apr 24, 2026 00:086,47071,162,30451,678,0002,026,0002,469,888
7Apr 24, 2026 00:086,50069,483,90949,954,0003,996,0002,433,024
8Apr 24, 2026 00:086,50874,366,41150,017,0004,001,0002,306,048
9Apr 24, 2026 00:086,51169,897,39251,040,0003,002,0002,433,024