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 listNov 22, 2024 19:03MatthiasMatthiasScore: 1,823,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 19:031,816,13315,105,740,89815,001,937,00071,970,0002,281,472
2Nov 22, 2024 19:031,816,46315,118,375,60115,014,668,00061,977,0002,289,664
3Nov 22, 2024 19:031,816,47915,103,793,20615,007,807,00068,971,0002,281,472
4Nov 22, 2024 19:031,822,04815,157,239,89715,048,027,00074,970,0002,289,664
5Nov 22, 2024 19:031,823,69015,167,140,64915,081,650,00054,976,0002,289,664
6Nov 22, 2024 19:031,823,76315,167,657,88815,071,267,00065,970,0002,281,472
7Nov 22, 2024 19:031,827,15915,199,053,30015,105,450,00059,970,0002,281,472
8Nov 22, 2024 19:031,829,24515,215,907,16615,114,766,00067,967,0002,281,472
9Nov 22, 2024 19:031,831,29815,230,307,12915,137,800,00061,974,0002,523,136