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 13, 2026 18:03M-RochatM-RochatScore: 19,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0419,580171,974,397161,454,0001,063,0002,113,536
2May 13, 2026 18:0419,664172,361,946162,189,0001,026,0002,113,536
3May 13, 2026 18:0419,714172,459,518162,585,0001,043,0002,113,536
4May 13, 2026 18:0419,757174,109,195162,956,0001,034,0002,113,536
5May 13, 2026 18:0419,766173,061,818163,042,0001,018,0002,113,536
6May 13, 2026 18:0419,775175,289,939163,093,0001,041,0002,113,536
7May 13, 2026 18:0419,943176,329,548164,507,0001,025,0002,113,536
8May 13, 2026 18:0420,421178,234,524168,467,0001,028,0002,113,536
9May 13, 2026 18:0422,784199,802,400188,086,0001,027,0002,113,536