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 listFeb 10, 2025 18:17NeoNeoScore: 33,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 18:1733,180301,982,741274,389,0001,001,0002,289,664
2Feb 10, 2025 18:1733,183301,558,270274,420,0001,001,0002,527,232
3Feb 10, 2025 18:1733,184299,719,219275,426,00002,289,664
4Feb 10, 2025 18:1733,194306,190,173275,510,00002,289,664
5Feb 10, 2025 18:1733,219300,328,030274,718,000998,0002,273,280
6Feb 10, 2025 18:1733,221307,278,907273,738,0001,998,0002,269,184
7Feb 10, 2025 18:1733,223305,780,988273,754,0001,998,0002,269,184
8Feb 10, 2025 18:1733,223302,347,895273,756,0001,998,0002,289,664
9Feb 10, 2025 18:1735,233323,430,714291,437,0001,001,0002,289,664