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:23Lickety SplitLickety SplitScore: 552,323Success
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:23547,35815,607,415,7174,543,074,54302,228,224
2Jul 27, 2024 22:23552,32316,064,509,5424,584,281,32802,301,952
3Jul 27, 2024 22:23555,24916,264,010,7174,608,569,63602,363,392