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 listOct 20, 2026 16:08Nao MinamiNao MinamiScore: 64,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 16:0864,404545,391,271471,233,00063,323,0002,117,632
2Oct 20, 2026 16:0864,429545,672,699471,568,00063,200,0002,117,632
3Oct 20, 2026 16:0864,461545,883,820470,807,00064,226,0002,117,632
4Oct 20, 2026 16:0864,481546,052,146471,803,00063,391,0002,117,632
5Oct 20, 2026 16:0864,489546,166,050472,112,00063,150,0002,117,632
6Oct 20, 2026 16:0864,531546,510,098471,968,00063,647,0002,117,632
7Oct 20, 2026 16:0864,568546,766,925472,455,00063,462,0002,117,632
8Oct 20, 2026 16:0864,591547,111,937472,062,00064,046,0002,117,632
9Oct 20, 2026 16:0864,627547,267,058472,398,00064,010,0002,117,632