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 3, 2026 12:34limanjun99limanjun99Score: 5,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 12:355,61266,223,40642,531,0004,050,0002,420,736
2May 3, 2026 12:355,61364,986,67243,556,0003,038,0002,412,544
3May 3, 2026 12:355,62366,552,71242,618,0004,058,0002,433,024
4May 3, 2026 12:355,63263,493,71642,687,0004,065,0002,424,832
5May 3, 2026 12:355,63761,214,61442,725,0004,069,0002,428,928
6May 3, 2026 12:355,65164,576,41743,846,0003,059,0002,433,024
7May 3, 2026 12:355,65273,530,87442,833,0004,079,0002,428,928
8May 3, 2026 12:355,69565,179,48443,249,0004,023,0002,424,832
9May 3, 2026 12:355,85867,311,21644,573,0004,052,0002,433,024