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 listApr 26, 2026 03:49zielajzielajScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:493,41042,407,87427,300,0001,011,0002,412,544
2Apr 26, 2026 03:493,41143,038,49227,306,0001,011,0002,306,048
3Apr 26, 2026 03:493,43745,680,83527,513,0001,019,0002,433,024
4Apr 26, 2026 03:493,43847,814,76427,517,0001,019,0002,420,736
5Apr 26, 2026 03:493,45145,160,08927,628,0001,023,0002,420,736
6Apr 26, 2026 03:493,52942,764,64128,288,0001,010,0002,310,144
7Apr 26, 2026 03:493,58045,119,68928,695,0001,024,0002,428,928
8Apr 26, 2026 03:493,59449,138,05727,847,0001,989,0002,424,832
9Apr 26, 2026 03:493,66244,651,89629,384,0001,013,0002,310,144