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 9, 2024 00:12Lickety SplitLickety SplitScore: 96,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 00:1296,542830,631,582782,294,00019,007,0002,310,144
2Oct 9, 2024 00:1296,598828,730,781781,767,00019,994,0002,420,736
3Oct 9, 2024 00:1296,618826,390,107786,933,00014,998,0002,371,584