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 16, 2025 22:41Ashish AhujaAshish AhujaScore: 19,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 22:4118,610186,254,474132,537,00021,923,0003,993,600
2Aug 16, 2025 22:4118,939186,872,311131,327,00025,867,0004,100,096
3Aug 16, 2025 22:4119,126184,716,954134,785,00023,961,0004,096,000
4Aug 16, 2025 22:4119,147189,072,438136,928,00021,988,0003,977,216
5Aug 16, 2025 22:4119,359192,272,242136,726,00023,952,0004,124,672
6Aug 16, 2025 22:4119,419191,250,820143,045,00018,132,0003,997,696
7Aug 16, 2025 22:4119,434193,359,194136,413,00024,893,0004,079,616
8Aug 16, 2025 22:4119,809195,393,891141,495,00022,918,0003,985,408
9Aug 16, 2025 22:4120,294204,242,445146,517,00021,927,0004,026,368