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 12, 2024 12:31Dmitrii KravchenkoDmitrii KravchenkoScore: 63,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 12:3163,029548,057,649522,143,0001,000,0002,281,472
2Sep 12, 2024 12:3163,030546,257,822522,150,0001,000,0002,281,472
3Sep 12, 2024 12:3163,081550,362,594522,577,000999,0002,318,336
4Sep 12, 2024 12:3163,105546,822,571521,774,0001,999,0002,281,472
5Sep 12, 2024 12:3163,112550,337,794521,834,0001,999,0002,281,472
6Sep 12, 2024 12:3163,134556,675,027522,011,0002,000,0002,318,336
7Sep 12, 2024 12:3163,174553,419,801523,345,0001,000,0002,322,432
8Sep 12, 2024 12:3163,180552,860,348523,390,0001,000,0002,314,240
9Sep 12, 2024 12:3163,211547,220,076523,652,000999,0002,281,472