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 listMar 19, 2026 15:14Ondřej PolaneckýOndřej PolaneckýScore: 8,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:148,41394,715,46268,834,000997,0002,273,280
2Mar 19, 2026 15:148,41689,339,96767,854,0001,995,0002,392,064
3Mar 19, 2026 15:148,42093,270,15868,884,000998,0002,498,560
4Mar 19, 2026 15:148,42292,551,97368,907,000998,0002,400,256
5Mar 19, 2026 15:148,42394,906,18367,918,0001,997,0002,273,280
6Mar 19, 2026 15:148,46993,545,34369,286,0001,004,0002,273,280
7Mar 19, 2026 15:148,47995,575,78470,374,00002,400,256
8Mar 19, 2026 15:148,70098,104,84970,205,0002,005,0002,273,280
9Mar 19, 2026 15:148,70499,263,02970,240,0002,006,0002,379,776