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 11, 2024 16:42Joad NacerJoad NacerScore: 18,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:4218,225178,072,508144,254,0007,012,0002,465,792
2Oct 11, 2024 16:4218,322180,907,489145,067,0007,003,0002,449,408
3Oct 11, 2024 16:4219,291184,428,219155,116,0005,003,0002,424,832