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 20, 2026 06:07M-RochatM-RochatScore: 11,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0811,798109,968,66495,595,0002,330,0002,113,536
2May 20, 2026 06:0811,802109,058,92495,629,0002,334,0002,113,536
3May 20, 2026 06:0811,804109,032,53695,628,0002,347,0002,113,536
4May 20, 2026 06:0811,805108,174,42895,970,0002,012,0002,113,536
5May 20, 2026 06:0811,828110,384,92196,162,0002,011,0002,113,536
6May 20, 2026 06:0811,874109,089,48296,492,0002,068,0002,113,536
7May 20, 2026 06:0811,893109,101,79396,663,0002,054,0002,113,536
8May 20, 2026 06:0811,896109,348,80996,671,0002,072,0002,113,536
9May 20, 2026 06:0811,925110,973,05496,886,0002,092,0002,113,536