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 listOct 1, 2023 21:36sliceteamsliceteamScore: 13,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:3613,641136,988,841112,223,0001,001,0002,260,992
2Oct 1, 2023 21:3613,642139,583,003112,224,0001,002,0002,260,992
3Oct 1, 2023 21:3613,645138,654,008111,249,0002,004,0002,392,064
4Oct 1, 2023 21:3613,647132,815,421111,269,0002,004,0002,506,752
5Oct 1, 2023 21:3613,652136,407,426113,314,00002,260,992
6Oct 1, 2023 21:3613,654181,875,970113,328,83102,277,376
7Oct 1, 2023 21:3613,658171,786,308113,361,53602,260,992
8Oct 1, 2023 21:3613,667179,604,991113,433,77402,273,280
9Oct 1, 2023 21:3613,716138,685,523111,846,0001,997,0002,523,136
10Oct 1, 2023 21:3613,781140,298,607113,379,0001,003,0002,387,968
11Oct 1, 2023 21:3613,793140,820,715113,477,0001,004,0002,379,776
12Oct 1, 2023 21:3613,807143,061,207113,596,0001,005,0002,260,992