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 10, 2024 08:02hype.ethhype.ethScore: 2,852,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2024 08:022,849,38823,706,398,68423,649,919,72802,265,088
2Jan 10, 2024 08:022,852,89223,742,043,99123,679,003,42602,314,240
3Jan 10, 2024 08:022,859,24823,797,938,49723,731,761,41702,187,264