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 20:49wnwnScore: 8,704Success
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 20:498,67696,466,53769,011,0003,000,0002,482,176
2Feb 16, 2026 20:498,70494,706,83169,234,0003,010,0002,486,272
3Feb 16, 2026 20:498,742103,408,83469,534,0003,023,0002,510,848