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 22:19Lickety SplitLickety SplitScore: 164,744Success
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 22:19164,6631,434,659,7801,366,704,10002,297,856
2Jul 27, 2024 22:19164,7441,426,294,3021,367,376,29902,301,952
3Jul 27, 2024 22:19165,3351,427,534,3031,372,279,86702,297,856