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 listSep 29, 2026 10:39wnwnScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:393,29336,186,72227,339,000020,480
2Sep 29, 2026 10:393,31136,135,22327,486,000020,480
3Sep 29, 2026 10:393,34736,588,70427,786,000020,480
4Sep 29, 2026 10:393,44737,344,60128,613,000020,480
5Sep 29, 2026 10:393,45237,314,97228,655,000020,480
6Sep 29, 2026 10:393,45842,562,48328,704,000020,480
7Sep 29, 2026 10:393,47937,632,20828,883,000020,480
8Sep 29, 2026 10:393,49038,402,84428,971,000020,480
9Sep 29, 2026 10:393,50537,775,66829,099,000020,480