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 24, 2025 10:51Jeffrey JianJeffrey JianScore: 395,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 10:51394,6073,299,592,5973,203,276,00071,961,0002,289,664
2Nov 24, 2025 10:51394,8103,308,309,8273,202,969,00073,953,0002,289,664
3Nov 24, 2025 10:51395,0363,308,274,9833,210,844,00067,954,0002,289,664
4Nov 24, 2025 10:51395,1233,302,476,3913,205,551,00073,966,0002,281,472
5Nov 24, 2025 10:51395,1503,313,240,8713,199,773,00079,969,0002,289,664
6Nov 24, 2025 10:51395,2743,310,927,6123,214,802,00065,975,0002,289,664
7Nov 24, 2025 10:51396,2443,317,627,1123,211,874,00076,949,0002,289,664
8Nov 24, 2025 10:51401,3643,356,740,0053,252,360,00078,960,0002,281,472
9Nov 24, 2025 10:51405,2423,391,849,2223,307,548,00055,958,0002,289,664