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 21, 2025 02:47Cameron AavikCameron AavikScore: 32,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 02:4732,527295,279,858212,983,00056,995,0002,539,520
2Jan 21, 2025 02:4732,755299,109,297222,889,00048,975,0002,301,952
3Jan 21, 2025 02:4732,825297,970,549216,357,00056,092,0002,318,336
4Jan 21, 2025 02:4732,884304,964,492214,951,00057,987,0002,428,928
5Jan 21, 2025 02:4732,971300,832,270213,737,00059,926,0002,293,760
6Jan 21, 2025 02:4732,983298,620,304211,813,00061,945,0002,310,144
7Jan 21, 2025 02:4733,061299,719,959218,322,00056,082,0002,539,520
8Jan 21, 2025 02:4733,163300,314,528216,196,00059,053,0002,314,240
9Jan 21, 2025 02:4733,302304,211,504220,325,00056,082,0002,539,520