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 16:51parastromparastromScore: 4,695Success
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 16:524,58348,527,72237,003,0001,039,0002,113,536
2Sep 29, 2026 16:524,60049,400,59937,090,0001,093,0002,113,536
3Sep 29, 2026 16:524,61648,847,76137,269,0001,050,0002,113,536
4Sep 29, 2026 16:524,63848,934,27937,458,0001,040,0002,113,536
5Sep 29, 2026 16:524,69550,002,21237,898,0001,071,0002,113,536
6Sep 29, 2026 16:524,70849,769,46838,021,0001,057,0002,113,536
7Sep 29, 2026 16:524,75949,881,61238,347,0001,154,0002,113,536
8Sep 29, 2026 16:524,84350,639,42439,068,0001,130,0002,113,536
9Sep 29, 2026 16:524,86750,955,20239,284,0001,116,0002,113,536