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 15, 2026 21:54Ondřej PolaneckýOndřej PolaneckýScore: 14,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 21:5414,875148,901,956122,457,0001,003,0002,289,664
2Mar 15, 2026 21:5414,887153,443,105122,559,0001,004,0002,273,280
3Mar 15, 2026 21:5414,907151,315,646121,734,0001,995,0002,277,376
4Mar 15, 2026 21:5414,911150,513,689122,765,000998,0002,289,664
5Mar 15, 2026 21:5414,913153,438,955122,781,000998,0002,371,584
6Mar 15, 2026 21:5414,915147,958,522121,797,0001,996,0002,281,472
7Mar 15, 2026 21:5414,920147,783,540121,843,0001,997,0002,289,664
8Mar 15, 2026 21:5414,932147,106,766121,938,0001,998,0002,351,104
9Mar 15, 2026 21:5414,964147,780,494122,196,0002,003,0002,371,584