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 5, 2025 08:17scompa18scompa18Score: 106,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 08:17106,303905,654,470663,482,000218,829,0002,281,472
2Jan 5, 2025 08:17106,548911,108,306663,513,000220,837,0002,281,472
3Jan 5, 2025 08:17106,716918,224,231666,806,000218,936,0002,506,752