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 11, 2026 22:36Sevas666Sevas666Score: 98,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 22:3698,323837,318,605753,075,00063,006,0002,293,760
2Jan 11, 2026 22:3698,336842,236,997749,171,00067,015,0002,535,424
3Jan 11, 2026 22:3698,390844,809,687750,668,00065,970,0002,547,712
4Jan 11, 2026 22:3698,393848,097,747751,690,00064,973,0002,535,424
5Jan 11, 2026 22:3698,410843,382,294754,821,00061,985,0002,551,808
6Jan 11, 2026 22:3698,441841,377,217753,058,00064,004,0002,551,808
7Jan 11, 2026 22:3698,473847,780,576753,383,00063,947,0002,539,520
8Jan 11, 2026 22:3698,484846,287,238752,465,00064,953,0002,539,520
9Jan 11, 2026 22:3698,492842,548,294751,522,00065,958,0002,539,520