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 19, 2026 22:23M-RochatM-RochatScore: 50,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 22:2549,957425,315,697349,139,00065,510,0002,117,632
2May 19, 2026 22:2550,015424,525,568349,379,00065,750,0002,117,632
3May 19, 2026 22:2550,033425,545,620349,518,00065,757,0002,117,632
4May 19, 2026 22:2550,080426,411,280350,055,00065,615,0002,117,632
5May 19, 2026 22:2550,122426,336,939349,976,00066,038,0002,117,632
6May 19, 2026 22:2550,181428,391,448349,923,00066,587,0002,117,632
7May 19, 2026 22:2550,196429,396,355350,490,00066,142,0002,117,632
8May 19, 2026 22:2550,217428,003,101349,973,00066,834,0002,117,632
9May 19, 2026 22:2550,333427,781,854350,462,00067,309,0002,117,632