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 listMay 19, 2025 12:36Parinay ChauhanParinay ChauhanScore: 395,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 12:36394,2723,297,625,1453,197,495,00074,964,0002,281,472
2May 19, 2025 12:36394,3023,294,354,3133,200,758,00071,949,0002,281,472
3May 19, 2025 12:36394,6333,303,659,1483,214,484,00060,971,0002,281,472
4May 19, 2025 12:36394,9363,302,656,0253,197,022,00080,949,0002,289,664
5May 19, 2025 12:36395,2133,305,872,7363,209,308,00070,962,0002,281,472
6May 19, 2025 12:36395,3503,309,452,7083,222,432,00058,971,0002,281,472
7May 19, 2025 12:36396,0273,313,513,1403,221,041,00065,980,0002,281,472
8May 19, 2025 12:36396,9713,316,917,5963,225,902,00068,955,0002,289,664
9May 19, 2025 12:36397,3373,330,877,9433,226,947,00070,954,0002,281,472