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 listAug 21, 2026 10:35C21C21Score: 26,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 10:3525,912235,347,892214,066,0001,004,0002,113,536
2Aug 21, 2026 10:3525,958233,898,437214,173,0001,281,0002,113,536
3Aug 21, 2026 10:3526,622230,884,941219,805,0001,160,0002,113,536
4Aug 21, 2026 10:3526,623244,079,865219,964,0001,013,0002,117,632
5Aug 21, 2026 10:3526,630231,910,601219,813,0001,221,0002,113,536
6Aug 21, 2026 10:3526,633231,136,816219,806,0001,251,0002,113,536
7Aug 21, 2026 10:3526,656231,974,660220,008,0001,242,0002,113,536
8Aug 21, 2026 10:3526,659231,306,726220,018,0001,255,0002,113,536
9Aug 21, 2026 10:3526,675231,355,406220,169,0001,237,0002,113,536