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:23Rajarshi BasuRajarshi BasuScore: 8,820Success
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:238,65298,169,54570,813,000997,0002,461,696
2Dec 4, 2025 13:238,656101,654,67069,848,0001,995,0002,289,664
3Dec 4, 2025 13:238,66499,355,97569,913,0001,997,0002,289,664
4Dec 4, 2025 13:238,82099,977,41372,202,0001,002,0002,289,664
5Dec 4, 2025 13:238,82096,689,38671,205,0002,005,0002,469,888
6Dec 4, 2025 13:238,85496,768,38072,482,0001,006,0002,453,504