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 23:34Lickety SplitLickety SplitScore: 80,503Success
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 23:3480,298716,735,370666,474,89002,273,280
2Jul 27, 2024 23:3480,503728,068,754668,175,34402,256,896
3Jul 27, 2024 23:3480,551724,447,032668,575,24902,265,088