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 listJan 23, 2025 16:13Lukas EschbacherLukas EschbacherScore: 64,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 16:1364,147559,868,691532,424,00002,367,488
2Jan 23, 2025 16:1364,172562,939,739532,631,00002,289,664
3Jan 23, 2025 16:1364,215560,228,494531,985,000999,0002,289,664
4Jan 23, 2025 16:1364,292564,790,453532,628,000999,0002,289,664
5Jan 23, 2025 16:1364,296560,198,287532,656,000999,0002,375,680
6Jan 23, 2025 16:1364,307564,146,440532,746,000999,0002,363,392
7Jan 23, 2025 16:1364,324557,191,296531,887,0001,999,0002,371,584
8Jan 23, 2025 16:1364,331562,443,836532,947,000999,0002,363,392
9Jan 23, 2025 16:1364,479559,097,921534,177,0001,000,0002,367,488