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 listOct 15, 2026 15:52timothygktimothygkScore: 44,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:5244,364378,675,777367,013,0001,209,0002,117,632stderr
2Oct 15, 2026 15:5244,376390,258,537367,307,0001,014,0002,117,632stderr
3Oct 15, 2026 15:5244,621389,930,604369,301,0001,054,0002,117,632stderr
4Oct 15, 2026 15:5244,640380,934,491369,315,0001,197,0002,117,632stderr
5Oct 15, 2026 15:5244,642381,103,334369,532,0001,003,0002,117,632stderr
6Oct 15, 2026 15:5244,697381,406,119369,952,0001,039,0002,117,632stderr
7Oct 15, 2026 15:5245,046384,385,186372,810,0001,072,0002,117,632stderr
8Oct 15, 2026 15:5245,113384,738,182373,319,0001,125,0002,117,632stderr
9Oct 15, 2026 15:5245,391387,122,726375,519,0001,227,0002,117,632stderr