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 listDec 4, 2025 13:35Rajarshi BasuRajarshi BasuScore: 8,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:358,20595,023,39066,096,0002,002,0002,498,560
2Dec 4, 2025 13:358,21497,503,42966,170,0002,005,0002,281,472
3Dec 4, 2025 13:358,21989,688,64967,214,0001,003,0002,490,368
4Dec 4, 2025 13:358,40597,473,36068,763,000996,0002,498,560
5Dec 4, 2025 13:358,436100,061,06770,019,00002,289,664
6Dec 4, 2025 13:358,437100,770,17668,023,0002,000,0002,289,664