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 05:39M-RochatM-RochatScore: 12,749Success
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 05:4012,707114,960,835102,202,0003,269,0002,113,536
2May 20, 2026 05:4012,713115,208,575102,230,0003,293,0002,113,536
3May 20, 2026 05:4012,725117,465,359102,327,0003,294,0002,113,536
4May 20, 2026 05:4012,733117,887,754102,403,0003,288,0002,117,632
5May 20, 2026 05:4012,749117,024,970102,536,0003,286,0002,113,536
6May 20, 2026 05:4012,749120,760,467102,513,0003,311,0002,113,536
7May 20, 2026 05:4012,785117,509,771103,079,0003,044,0002,113,536
8May 20, 2026 05:4012,811118,074,084102,896,0003,436,0002,113,536
9May 20, 2026 05:4012,851117,792,287103,224,0003,447,0002,113,536