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 12, 2025 22:07Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 61,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 22:0761,801533,946,062510,950,0001,999,0002,289,664
2Feb 12, 2025 22:0761,817544,055,032511,080,0002,000,0002,281,472
3Feb 12, 2025 22:0761,870538,649,096513,524,00002,265,088