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 27, 2024 16:03Boris-Chengbiao ZhouBoris-Chengbiao ZhouScore: 53,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 16:0452,896497,685,396439,033,79402,240,512
2Jul 27, 2024 16:0452,948499,785,441439,471,70402,236,416
3Jul 27, 2024 16:0353,008524,027,913439,963,44702,269,184
4Jul 27, 2024 16:0353,012511,075,332440,001,39502,228,224
5Jul 27, 2024 16:0453,049511,457,672440,307,43102,236,416
6Jul 27, 2024 16:0353,090501,432,668440,643,35402,232,320