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 02:16zielajzielajScore: 3,714Success
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 02:163,66453,748,93829,402,0001,013,0002,523,136
2Nov 15, 2024 02:163,67753,890,84229,502,0001,017,0002,437,120
3Nov 15, 2024 02:163,68157,382,11129,536,0001,018,0002,351,104
4Nov 15, 2024 02:163,68256,842,52029,543,0001,018,0002,527,232
5Nov 15, 2024 02:163,68359,916,74030,571,00002,347,008
6Nov 15, 2024 02:163,68658,899,13929,577,0001,019,0002,351,104
7Nov 15, 2024 02:163,71456,302,81729,834,000994,0002,527,232
8Nov 15, 2024 02:163,71855,702,35129,861,000995,0002,527,232
9Nov 15, 2024 02:163,71961,030,86530,865,00002,351,104
10Nov 15, 2024 02:163,76552,294,58430,244,0001,008,0002,355,200
11Nov 15, 2024 02:163,80157,806,46831,551,00002,269,184
12Nov 15, 2024 02:163,80554,720,97430,563,0001,018,0002,277,376