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 5, 2026 00:05olliecrowolliecrowScore: 6,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:105,98757,072,87547,481,0002,212,0002,363,392
2May 5, 2026 00:106,08274,993,07548,303,0002,185,0002,306,048
3May 5, 2026 00:106,11175,028,62548,605,0002,121,0002,342,912
4May 5, 2026 00:106,12074,653,63248,664,0002,139,0002,289,664
5May 5, 2026 00:106,14077,957,72548,783,0002,187,0002,338,816
6May 5, 2026 00:106,14457,716,52348,802,0002,199,0002,560,000
7May 5, 2026 00:106,21172,903,93849,212,0002,342,0002,359,296
8May 5, 2026 00:106,22078,811,65949,434,0002,197,0002,371,584
9May 5, 2026 00:106,24974,440,56049,695,0002,178,0002,322,432