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 listSep 27, 2026 18:29Karthik ReddyKarthik ReddyScore: 6,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 18:296,73466,170,85854,743,0001,157,0002,113,536
2Sep 27, 2026 18:296,73666,342,69554,759,0001,156,0002,113,536
3Sep 27, 2026 18:296,74066,370,04754,800,0001,145,0002,113,536
4Sep 27, 2026 18:296,74366,417,76054,829,0001,145,0002,113,536
5Sep 27, 2026 18:296,75166,408,57154,886,0001,148,0002,113,536
6Sep 27, 2026 18:296,75466,426,54654,920,0001,143,0002,113,536
7Sep 27, 2026 18:296,75566,398,07254,911,0001,161,0002,113,536
8Sep 27, 2026 18:296,76866,462,72855,014,0001,163,0002,113,536
9Sep 27, 2026 18:296,77667,816,64855,088,0001,156,0002,113,536