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 listJul 29, 2024 03:47Liam BuchananLiam BuchananScore: 34,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 03:4834,792347,812,335288,772,99702,174,976
2Jul 29, 2024 03:4734,794348,423,735288,791,90802,170,880
3Jul 29, 2024 03:4834,796361,961,314288,805,96202,183,168
4Jul 29, 2024 03:4834,802345,001,432288,853,89402,170,880
5Jul 29, 2024 03:4734,804353,548,510288,877,01702,183,168
6Jul 29, 2024 03:4734,818352,806,231288,990,29002,301,952