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 listApr 27, 2026 10:09wnwnScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:103,39744,647,71427,190,0001,007,0002,490,368
2Apr 27, 2026 10:103,43246,782,09027,471,0001,017,0002,486,272
3Apr 27, 2026 10:103,43544,531,22127,495,0001,018,0002,482,176
4Apr 27, 2026 10:103,44646,466,57127,584,0001,021,0002,490,368
5Apr 27, 2026 10:103,46041,659,19127,701,0001,025,0002,547,712
6Apr 27, 2026 10:103,53847,903,44528,355,0001,012,0002,490,368
7Apr 27, 2026 10:103,54647,035,62028,421,0001,015,0002,482,176
8Apr 27, 2026 10:103,61047,804,15127,969,0001,997,0002,482,176
9Apr 27, 2026 10:103,63844,272,02329,193,0001,006,0002,494,464