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 listMay 17, 2026 20:58zielajzielajScore: 60,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 20:5860,021507,242,162497,045,0001,137,0002,113,536
2May 17, 2026 20:5860,105509,596,389497,753,0001,125,0002,113,536
3May 17, 2026 20:5860,701512,066,654502,784,0001,035,0002,113,536
4May 17, 2026 20:5860,711512,211,413502,819,0001,084,0002,113,536
5May 17, 2026 20:5860,712513,657,054502,907,0001,006,0002,113,536
6May 17, 2026 20:5860,713511,735,749502,804,0001,117,0002,113,536
7May 17, 2026 20:5860,716514,693,410502,862,0001,086,0002,113,536
8May 17, 2026 20:5860,721512,712,824502,884,0001,107,0002,113,536
9May 17, 2026 20:5860,735512,215,053503,007,0001,096,0002,113,536