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 3, 2025 22:16Adam FolwarcznyAdam FolwarcznyScore: 7,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2025 22:167,76388,572,31950,340,00014,095,0002,277,376
2Sep 3, 2025 22:167,80992,396,07148,863,00015,955,0002,273,280
3Sep 3, 2025 22:167,85686,489,06148,150,00017,053,0002,486,272
4Sep 3, 2025 22:167,92194,316,68647,815,00017,930,0002,539,520
5Sep 3, 2025 22:167,92388,479,00149,818,00015,942,0002,273,280
6Sep 3, 2025 22:168,08893,729,68650,097,00017,033,0002,539,520