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 27, 2025 19:07Oleg KovalovOleg KovalovScore: 69,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 19:0769,978610,168,039578,815,0001,999,0002,482,176
2Jan 27, 2025 19:0769,986612,445,744578,887,0001,999,0002,486,272
3Jan 27, 2025 19:0769,992605,129,598578,938,0001,999,0002,490,368
4Jan 27, 2025 19:0769,992603,323,540577,934,0002,999,0002,486,272
5Jan 27, 2025 19:0769,995607,032,709577,961,0002,999,0002,289,664
6Jan 27, 2025 19:0769,999608,134,571578,992,0001,999,0002,326,528
7Jan 27, 2025 19:0770,011608,193,540579,091,0002,000,0002,326,528
8Jan 27, 2025 19:0770,021609,582,687578,172,0003,000,0002,482,176
9Jan 27, 2025 19:0770,053608,525,812578,443,0002,997,0002,318,336