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 listApr 27, 2024 06:42Anoushk KharangateAnoushk KharangateScore: 342,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 06:42342,3502,901,354,0842,841,507,16002,220,032
2Apr 27, 2024 06:42342,4552,896,797,1172,842,376,22502,211,840
3Apr 27, 2024 06:42342,5902,919,274,0342,843,495,35702,211,840