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 30, 2026 03:53Josu San MartinJosu San MartinScore: 48,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:5348,557424,005,860401,020,0002,000,0002,449,408
2Jan 30, 2026 03:5348,682426,119,505403,059,0001,000,0002,510,848
3Jan 30, 2026 03:5348,688425,875,881403,108,0001,000,0002,457,600