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 5, 2026 01:53FrederickFrederickScore: 10,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:5410,75399,670,56988,240,0001,011,0002,117,632
2Oct 5, 2026 01:5410,77499,897,36788,416,0001,009,0002,117,632
3Oct 5, 2026 01:5410,778100,008,49588,456,0001,009,0002,117,632
4Oct 5, 2026 01:5410,877100,774,75389,274,0001,010,0002,117,632
5Oct 5, 2026 01:5410,905100,968,44089,506,0001,012,0002,117,632
6Oct 5, 2026 01:5410,967101,509,69490,015,0001,012,0002,117,632
7Oct 5, 2026 01:5411,065102,318,40090,827,0001,013,0002,117,632
8Oct 5, 2026 01:5411,108102,665,29891,176,0001,027,0002,117,632
9Oct 5, 2026 01:5411,334104,510,82493,064,0001,010,0002,117,632