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 listJan 18, 2025 20:33Rodrigo PalmeirimRodrigo PalmeirimScore: 73,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 20:3373,868634,995,833612,106,0001,000,0002,281,472
2Jan 18, 2025 20:3373,897640,504,690612,343,0001,000,0002,269,184
3Jan 18, 2025 20:3373,899644,364,654612,365,0001,000,0002,289,664
4Jan 18, 2025 20:3373,921644,831,790611,550,0001,998,0002,265,088
5Jan 18, 2025 20:3373,922639,326,475611,555,0001,998,0002,289,664
6Jan 18, 2025 20:3373,928642,387,698611,604,0001,998,0002,289,664
7Jan 18, 2025 20:3373,935636,838,723611,665,0001,998,0002,289,664
8Jan 18, 2025 20:3373,940636,961,172612,703,000999,0002,289,664
9Jan 18, 2025 20:3373,947637,521,998611,757,0001,999,0002,281,472