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 listMar 1, 2026 21:12wnwnScore: 4,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 21:124,39055,871,80135,422,0001,012,0002,277,376
2Mar 1, 2026 21:124,39159,323,04135,435,0001,012,0002,277,376
3Mar 1, 2026 21:124,40462,911,76235,538,0001,015,0002,502,656
4Mar 1, 2026 21:124,41063,704,90535,591,0001,016,0002,277,376
5Mar 1, 2026 21:124,43467,724,61634,816,0001,989,0002,273,280
6Mar 1, 2026 21:128,675100,606,55070,002,0002,000,0002,486,272