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 16, 2022 23:24Yuriy LyfenkoYuriy LyfenkoScore: 30,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 23:2430,758324,948,628255,289,42102,215,936
2Jan 16, 2022 23:2430,771331,628,422255,401,13402,220,032
3Jan 16, 2022 23:2430,772326,777,002255,408,90802,211,840