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 listNov 15, 2024 03:47zielajzielajScore: 3,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 03:453,55757,842,70129,520,00002,367,488
2Nov 15, 2024 03:453,58160,077,68129,722,00002,359,296
3Nov 15, 2024 03:473,59555,354,57629,836,00002,273,280
4Nov 15, 2024 03:453,59657,112,06127,858,0001,989,0002,351,104
5Nov 15, 2024 03:473,59657,144,99526,865,0002,985,0002,359,296
6Nov 15, 2024 03:473,59754,242,70827,865,0001,990,0002,363,392
7Nov 15, 2024 03:473,73458,288,03629,990,000999,0002,531,328
8Nov 15, 2024 03:453,75258,581,66329,134,0002,009,0002,531,328
9Nov 15, 2024 03:453,75255,628,26630,141,0001,004,0002,367,488
10Nov 15, 2024 03:473,75558,236,79130,163,0001,005,0002,363,392
11Nov 15, 2024 03:473,77453,423,08731,322,00002,269,184
12Nov 15, 2024 03:453,80054,451,94631,537,00002,367,488