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 26, 2026 11:53Kenzie_RTKenzie_RTScore: 66,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 11:5366,799564,462,857553,279,0001,159,0002,113,536
2May 26, 2026 11:5366,818564,152,010553,590,0001,004,0002,113,536
3May 26, 2026 11:5366,834564,789,706553,638,0001,092,0002,113,536
4May 26, 2026 11:5366,869565,247,313553,964,0001,054,0002,113,536
5May 26, 2026 11:5366,887564,967,935554,141,0001,028,0002,113,536
6May 26, 2026 11:5366,887567,743,610554,163,0001,006,0002,113,536
7May 26, 2026 11:5366,920565,612,718554,270,0001,170,0002,113,536
8May 26, 2026 11:5366,975566,976,675554,767,0001,128,0002,113,536
9May 26, 2026 11:5367,000570,070,921555,056,0001,052,0002,113,536