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 10, 2024 20:03Joad NacerJoad NacerScore: 8,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:038,65197,905,60969,808,0001,994,0002,486,272
2Oct 10, 2024 20:038,67298,564,18269,976,0001,999,0002,351,104
3Oct 10, 2024 20:038,695100,185,37371,164,0001,002,0002,351,104
4Oct 10, 2024 20:038,939100,282,08772,187,0002,005,0002,351,104
5Oct 10, 2024 20:038,94296,315,02472,215,0002,005,0002,482,176
6Oct 10, 2024 20:038,94797,109,42072,253,0002,007,0002,351,104