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 listAug 4, 2026 07:45Teow Hua JunTeow Hua JunScore: 6,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:456,87868,167,88955,974,0001,117,0002,113,536
2Aug 4, 2026 07:456,88167,168,03656,005,0001,112,0002,113,536
3Aug 4, 2026 07:456,89467,221,46456,120,0001,104,0002,113,536
4Aug 4, 2026 07:456,90167,279,45856,266,0001,016,0002,113,536
5Aug 4, 2026 07:456,90567,256,15756,174,0001,141,0002,113,536
6Aug 4, 2026 07:456,91368,193,87056,229,0001,151,0002,113,536
7Aug 4, 2026 07:456,93679,485,87756,558,0001,017,0002,113,536
8Aug 4, 2026 07:456,95277,546,54456,647,0001,057,0002,117,632
9Aug 4, 2026 07:456,97980,224,76556,864,0001,066,0002,113,536