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:12Lickety SplitLickety SplitScore: 114,904Success
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:12114,2181,001,018,425948,009,95702,179,072
2Jul 27, 2024 23:12114,9041,008,975,605953,702,98702,191,360
3Jul 27, 2024 23:12115,0541,019,956,071954,949,76702,187,264