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 16, 2026 19:42wnwnScore: 8,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:427,39084,813,09857,312,0004,021,0002,355,200
2Feb 16, 2026 19:427,45689,015,68358,890,0002,994,0002,367,488
3Feb 16, 2026 19:427,57096,465,74658,843,0003,989,0002,519,040
4Feb 16, 2026 19:428,58797,990,43468,259,0003,011,0002,355,200
5Feb 16, 2026 19:428,60297,120,25768,380,0003,016,0002,269,184
6Feb 16, 2026 19:428,61195,298,66068,453,0003,020,0002,265,088