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 listApr 9, 2026 16:24Oleg SkinderevOleg SkinderevScore: 82,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 16:2482,071708,228,710619,174,00062,017,0002,273,280
2Apr 9, 2026 16:2482,082709,530,751615,350,00065,930,0002,273,280
3Apr 9, 2026 16:2482,095707,981,431625,437,00055,949,0002,273,280
4Apr 9, 2026 16:2482,096707,259,133616,361,00065,038,0002,273,280
5Apr 9, 2026 16:2482,112715,023,846614,576,00066,953,0002,273,280
6Apr 9, 2026 16:2482,130710,641,098621,710,00059,972,0002,285,568
7Apr 9, 2026 16:2482,137709,684,655625,763,00055,978,0002,375,680
8Apr 9, 2026 16:2482,144711,164,654621,816,00059,982,0002,273,280
9Apr 9, 2026 16:2482,241713,943,623608,642,00073,956,0002,273,280