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 21, 2026 21:57M-RochatM-RochatScore: 6,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:586,58566,134,18952,591,0002,067,0002,113,536
2May 21, 2026 21:586,58965,819,75952,648,0002,048,0002,113,536
3May 21, 2026 21:586,59165,848,95452,663,0002,043,0002,113,536
4May 21, 2026 21:586,59764,122,05152,710,0002,053,0002,113,536
5May 21, 2026 21:586,60266,677,15452,721,0002,083,0002,113,536
6May 21, 2026 21:586,60467,065,27852,747,0002,067,0002,113,536
7May 21, 2026 21:586,60866,002,39152,776,0002,078,0002,113,536
8May 21, 2026 21:586,61366,650,83152,822,0002,068,0002,113,536
9May 21, 2026 21:586,72665,250,97053,673,0002,158,0002,113,536