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 29, 2026 12:37TudyMTudyMScore: 39,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 12:3739,092342,324,470323,468,0001,001,0002,383,872
2Apr 29, 2026 12:3739,107342,042,761323,594,0001,001,0002,383,872
3Apr 29, 2026 12:3739,113346,017,423323,646,000998,0002,387,968
4Apr 29, 2026 12:3739,114348,016,380321,658,0002,996,0002,375,680
5Apr 29, 2026 12:3739,132340,556,143322,799,0001,998,0002,383,872
6Apr 29, 2026 12:3739,155345,488,786321,989,0002,999,0002,379,776
7Apr 29, 2026 12:3739,183344,986,237324,225,0001,000,0002,387,968
8Apr 29, 2026 12:3739,193340,683,107324,308,0001,000,0002,379,776
9Apr 29, 2026 12:3739,240342,046,995323,695,0001,998,0002,383,872