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 06:00M-RochatM-RochatScore: 11,814Success
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 06:0111,787107,174,69295,513,0002,322,0002,113,536
2May 20, 2026 06:0111,788107,244,24595,505,0002,336,0002,113,536
3May 20, 2026 06:0111,803110,077,56695,927,0002,041,0002,113,536
4May 20, 2026 06:0111,807109,319,15195,677,0002,327,0002,113,536
5May 20, 2026 06:0111,814109,825,52395,714,0002,343,0002,113,536
6May 20, 2026 06:0111,815107,512,24995,967,0002,105,0002,113,536
7May 20, 2026 06:0111,827109,421,60996,151,0002,021,0002,113,536
8May 20, 2026 06:0111,832110,863,71596,164,0002,045,0002,113,536
9May 20, 2026 06:0111,910110,571,72096,728,0002,125,0002,113,536